I did the chocolate 2 problem on timus online judge but i don't understand it fully.

my question is that why the number of moves is constant for a specific pair of n and m.