Question 71
In a certain two-player game, you start with a rectangular $m \times n$ grid of squares. On each turn, a player either makes a horizontal cut and takes away the portion of the rectangle above the cut, or makes a vertical cut and takes away the portion to the right. Whichever player takes the last square (in the bottom left corner) loses. If both players play perfectly, determine for which values of $m$ and $n$ the first player will win.