Question 19
(MON 6) A positive integer is written in each square of an $m\times n$ board. The allowed move is to add an integer $k$ to each of two adjacent numbers in such a way that no negative numbers are obtained. (Two squares are adjacent if they have a common side.) Find a necessary and sufficient condition for it to be possible for all the numbers to be zero by a finite sequence of moves.