The teacher reported to Peter an odd integer $m \le 2013$ and gave the guy a homework. Petrick should star the cells in the $2013 \times 2013$ table so to make the condition true: if there is an asterisk in some cell in the table, then or in row or column containing this cell should be no more than $m$ stars (including this one). Thus in each cell of the table the guy can put at most one star. The teacher promised Peter that his assessment would be just the number of stars that the guy will be able to place. What is the greatest number will the stars be able to place in the table Petrick?