MathNet 2010 — Part 01 Question 126

There is a heap of 330 stones. Nick and Mike play the following game. They, in turn (Nick is the first), remove the stones from the heap. Per move it is allowed to remove exactly 1 or exactly $m$ or exactly $n$ stones. The player wins if he removes the last stone. Before the start Nick fixes the value of $n$ ($1 \lt n \lt 10$). After that Mike fixes the value of $m$ ($m \ne n$, $1 \lt m \lt 10$), and Nick begins the game.
Can somebody of the players fix his number to win if both of them play to win?