|Contests||Virtual Contests||Problems||Submit||Runs Status||Rank List||Forum|
Once a day, two people, A and B, played the game created by themselves again. Though they have played the game for many time, on the day something strange occured that B alway won the game. A was worried about whether he could win the game for at least one time, so A ask you for some help. Here are the rules:
1. This is a game played by two players in turn; one of them plays first.(Actually A was always the first one)
2. The game uses two piles of stones as tools. In one turn, one of the players takes at least one stone away from either of the piles.
3. The game ends with all stones taken away, and the player played last turn win the game.
In order to win the game, A praicticed for so many times that he can count out all the stones of either pile. Now your mission is to tell whether A can win the game even though B is smart enough to take the optional strategy.
There are several cases. Each case has one line containing two numbers: n, m indicating the number of either pile. 0 <= n, m < 10^50.
One line for each case with "Yes"(A could win) or "No"(A can't win).
1 1 2 1