5. There are two piles of stones: 1703 stones in one pile and 2022 in the other. Sasha and Olya are playing a game, taking turns, with Sasha starting. Let the piles contain $a$ and $b$ stones before the player's move, with $a \geqslant b$. Then, on their turn, the player is allowed to take any number of stones from the pile with $a$ stones, ranging from 1 to $b$. The player who cannot make a move loses. Who will win with correct play?
Answer: Sasha will win. Suppose the position $a>b$ is a losing position. Then all positions $(a-k, b)$ for $k=1, \ldots, b$ are winning. But since $a-1 \geqslant b-$ is winning, from it one can obtain some losing position, and it can only be the position $(a-b-1, b)$. By such procedures, one can obtain losing positions: $(2022,1703 \rightarrow(1703,318) \rightarrow(318,108) \rightarrow(108,100) \rightarrow(100,7) \rightarrow(7,4)$. However, it is not difficult to verify that this position is winning. Therefore, the initial position is also winning.