MathNet 2015-part-06 — 191 problems (EN–VI) Question 122

We call the game piece shown below a staircase. For which pairs $(m, n)$ of natural numbers with $m, n \geq 6$ is it possible to cover an $m \times n$ board completely and without overlaps with staircases?