Question 117
There is a $m \times n$ board divided into $mn$ unit squares, and we have drawn one of the two diagonals of each unit square. Prove that there is a path using only these diagonals that either connects the upper side of the board to the lower side or connects the left side of it to the right side.