Problem #PRU-5126

Problem

There are real numbers written on each field of a $m\times n$ chessboard. Some of them are negative, some are positive. In one move we can multiply all the numbers in one column or row by $-1$. Is that always possible to obtain a chessboard where sums of numbers in each row and column are non-negative?