Chopsticks Game

Two players, $A$ and $B$, play a chopsticks game. Player $A$ has $N$ hands, and player $B$ has $M$ hands. Initially, each hand has either $1$ or $2$ raised fingers. Player $A$ moves first, and the players alternate turns.

On a turn, the current player chooses one of their own living hands and one of the opponent's living hands to attack. If the attacking hand has $x$ raised fingers and the attacked hand has $y$ raised fingers, the attacked hand's finger count becomes $x+y$. If $x+y\geq3$, the attacked hand dies immediately. The attacking hand does not change.

A hand may attack or be attacked again on later turns as long as it is alive. A dead hand cannot be used again. Hands cannot be merged or split.

A player loses when none of their hands are alive. Determine whether the first player, $A$, wins when both players play optimally.

The input is given in the following format:

$T$ $\mathrm{case}_1$ $\mathrm{case}_2$

For each test case, print the answer on its own line. Print First if player $A$ wins; otherwise, print Second.

• $1\leq T\leq100\,000$.
• $1\leq N,M\leq10^{18}$.