discrete mathematics - Proof for a $n times m$ checkerboard tiling

I believe it is a basic problem, but I would like some help proving this statement:

Prove that a $n\times m$ checkerboard can be filled with $k\times 1$ tiles if and only if k divides m or n.