I dont understand why the number of moves is constant.
How to prove it??

think in this way, each time a player makes a move, the number of chocolate pieces increases in one (first there is one piece, then two, then three and so on). But the game stop when there are n*m pieces, so there must've been n*m-1 moves.