Question 80
Determine all pairs of positive integers $(m,n)$ for which stones can be placed in some cells of a board with $m$ rows and $n$ columns, at most one stone per cell, so that every column has the same number of stones and no two rows have the same number of stones.