MathDB

There are two piles of stones:

1703

stones in one pile and

2022

in the other. Sasha and Olya play the game, making moves in turn, Sasha starts. Let before the player's move the heaps contain

a

and

b

stones, with

a \geq b

. Then, on his own move, the player is allowed take from the pile with

a

stones any number of stones from

1

b

. A player loses if he can't make a move. Who wins?
Remark: For 10.4, the initial numbers are

(444,999)

Problem Statement