Question 3
Let $m\lt 2001$ and $n\lt 2002$ be positive integers. Distinct real numbers are placed in a table with $2001$ rows and $2002$ columns. An entry is called bad if it is smaller than at least $m$ entries in its column and at least $n$ entries in its row. What is the largest possible number of bad entries?