Non-Zero Xor

You are given an $N*M$ board of non-negative integers. You wish to make the bitwise XOR of the elements of each row and each column non-zero. In one operation, you may increase the number in any cell by any amount. More formally, if the value in a cell is $x$, you may replace it by any value $y \geq x$. Calculate the minimum operations required to achieve your objective. ### Input - First line