Description

Input

The first line contains a single integer $t$ ($1 \le t \le 10^4$) — the number of test cases.

Each test case consists of three integers $a$, $b$, and $c$ ($1 \le a, b, c \le 10^9$) — the number of buttons that can only be pressed by Anna, the number of buttons that can only be pressed by Katie, and the number of buttons that can be pressed by either of them, respectively.

Output

For each test case, output First if Anna wins, or Second if Katie wins.

5
1 1 1
9 3 3
1 2 3
6 6 9
2 2 8

First
First
Second
First
Second

Note

For the simplicity of the explanation, we will numerate the buttons by the numbers from $1$ to $a+b+c$: the first $a$ buttons can only be pressed by Anna, the next $b$ buttons can only be pressed by Katie, and the last $c$ buttons can be pressed by either of them.

In the first test case, Anna can press the $3$-rd button on the first turn. Then Katie will press the $2$-nd button (since it is the only possible turn for her). Then Anna will press the $1$-st button. Katie won't have a button to press, so Anna will win.

In the second test case, Anna can press the first nine buttons in some order on her turns. No matter what buttons Katie will press, all the buttons from the $10$-th to the $15$-th will be pressed after $12$ turns. On the $13$-th turn, Anna will press one of the first nine buttons and Katie will not have a button to press on her turn. Thus, Anna will win.

In the third test case, the game can proceed as follows:

• On the $1$-st turn Anna presses the $5$-th button.
• On the $2$-st turn Katie presses the $4$-th button.
• On the $3$-st turn Anna presses the $6$-th button.
• On the $4$-st turn Katie presses the $3$-th button.
• On the $5$-st turn Anna presses the $1$-th button.
• On the $6$-st turn Katie presses the $2$-th button.
• Anna cannot make the turn, so Katie wins.

It can be shown that Katie can win no matter what moves Anna takes.