Consider the following variant of the two-player game of Nim,
originated in China:
There are six sets numbered from 1 to 6,
each one with *m*_{i} marbles.
Initially, we have *m*_{i} = *i* for every 1 ≤ *i* ≤ 6.
In turns, every player must choose one of the non-empty sets
and remove at least one of its marbles.
The player that removes the last marble(s) wins the game.

For instance, let Anne and Bill be the players.
This is a possible situation of the game after several turns
(the first number denotes *m*_{1} and so on):

1 1 0 0 5 0 |

If it is Anne’s turn, she may choose to remove the five marbles of the fifth set:

1 1 0 0 0 0 |

Next Bill has no real option: he must remove one marble from any set (say the first one):

0 1 0 0 0 0 |

Now Anne can remove the last marble, and therefore she wins the game. Note, if Anne had made any other movement in the first place, she would had lost the game had Bill played perfectly.

Write a program such that, given the names of the players (first the player to play next) and the current number of marbles of every set, prints the name of the player that wins the game, assuming perfect play from both sides.

**Input**

Input begins with the number of cases.
Every case consists of the names (only letters) of the players,
followed by *m*_{1}, …, *m*_{6}.
You can assume 0 ≤ *m*_{i} ≤ *i*
and *m*_{1} + ⋯ + *m*_{6} ≥ 1.

**Output**

For every case, print its number, followed by the name of the winner assuming perfect play.

Public test cases

**Input**

3 Ann Bill 1 1 0 0 5 0 A B 0 0 2 0 0 0 x y 0 0 3 3 0 0

**Output**

Game #1: Ann Game #2: A Game #3: y

Information

- Author
- Salvador Roura
- Language
- English
- Other languages
- Catalan
- Official solutions
- C++
- User solutions
- C++