A table with $m$ rows and $n$ columns is given. At any move one chooses some empty cells such that any two of them lie in different rows and columns, puts a white piece in any of these cells and then puts a black piece in the cells whose lines and columns contain white pieces. The game is over if it is not possible to make a move. Find the maximum possible number of the white pieces that can be put on the table.