David and Esther play the following game. Initially, there are three piles, each containing 1000 stones. The players take turns to make a move, with David going first. Each move consists of choosing one of the piles available, removing the unchosen pile(s) from the game, and then dividing the chosen pile into 2 or 3 non-empty piles. A player loses the game if they are unable to make a move. Prove that Esther can always win the game, no matter how David plays.