Question 140
Let be given two positive integers $m$, $n$ with $m \lt 2001$, $n \lt 2002$; and let be given $2001 \times 2002$ distinct real numbers. Put these numbers into the little squares of a rectangular board of size $2001 \times 2002$ (the board consists of $2001$ rows and $2002$ columns) so that each number is putting in a little square and each little square is filling with a number. We call a little square "bad" if the number put in it is less than at least $m$ numbers put in the same column as the considered little square and simultaneously this number is less than at least $n$ numbers put in the same row as the considered little square. For each such filling, let $s$ be the number of "bad" little squares. Find the least value of $s$.