시간 제한 | 메모리 제한 | 제출 | 정답 | 맞은 사람 | 정답 비율 |
---|---|---|---|---|---|

1 초 | 128 MB | 0 | 0 | 0 | 0.000% |

You are staying in the country of Determinisia for a challenging programming contest. The Determinisians are very fond of playing deterministic games, i.e. games of which the result can be known in advance, assuming the players play optimally. They really love to see each time everything is going exactly the way they had foreseen.

The great teacher Oneplusoneistwo has developed the game Nim some thousands of years ago, and this game is still very popular in Determinisia. This game is quite simple: there are three (possibly empty) stacks of matches. By turns, the players must choose a non-empty stack and remove any positive number of matches from it. The first player to make all three stacks empty, wins.

Recently, the scientist Oneplustwoisthree has suggested to make a three player Nim game, called Nim/3. In order to make this game deterministic, each of the players has one of the other two players as a favorite; in case he can’t win himself, he will try to let his favorite win. The players must also know each other’s favorites.

In order to socialize with the local students, you want to play a few games of Nim/3 with them. But this is only possible when you play the game in an optimal way. Luckily, you are allowed to write a computer program to assist you during game play.

The first line of the input file contains a single number: the number of test cases to follow. Each test case has the following format:

- One line with six integers: s
_{1}s_{2}s_{3}f_{1}f_{2}f_{3}. Here, s_{1}, s_{2}and s_{3}denote the number of matches on the stacks 1, 2 and 3 respectively (0 ≤ s_{n}≤ 20, s_{1}+ s_{2}+ s_{3}≥ 1). f_{1}, f_{2}and f_{3}indicate the favorite player of player 1, 2 and 3 respectively.

Note that f_{p} ∈ {1, 2, 3} \ {p}. Currently it is the turn of player 1, followed by player 2 and 3 respectively.

For every test case in the input file, the output should contain two numbers, on a single line, separated by a space: k and n. k ∈ {1,2,3} is the stack and 0 < n ≤ s_{k} the number of matches to take from that stack by player 1, when he plays an optimal game. There might be multiple optimal choices, but you should give the one with k as small as possible, and next n as small as possible.

3 1 1 5 3 3 2 1 1 5 2 1 1 0 1 4 2 1 1

3 4 1 1 3 1