Under construction

Still being built. Things may change

Building the Robot Convergence Hall

Time limit2sMemory limit1024 MB

Summary
Given N columns and M floors, decide whether Minjae should move first or second to force a fully blue row or column in a block-placing game.
Level

Medium6 of 10

Topics
Game theory, Math
Solved
No attempts yet

Problem

While walking to the Robot Convergence Hall at Korea University with Junhyeok, Minjae wondered about something and had this conversation with him.

  • Minjae: Why is it called the Robot Convergence Hall?
  • Junhyeok: Probably because robots built the building.
  • Minjae: Wow, really?

Minjae, an algorithm enthusiast, became curious about which construction algorithm was used to build the Robot Convergence Hall. To find out, he visited his senior Junhyeok and asked him to explain the algorithm. Junhyeok said he would teach it if Minjae beat him in the following game.

  1. A 1×N1\times N rectangle is drawn on the ground. The rectangle is divided into NN adjacent 1×11\times 1 squares, and the numbers 1 through NN are written on them from left to right.
  2. Two players take turns placing a unit cube block each. A block can be placed on any of the NN square positions. If a block is already stacked at the chosen position, the new block goes on top of it. However, the Robot Convergence Hall has MM floors, so the height of a stack cannot exceed MM.
  3. The first player always places a blue cube block, and the second player always places a red cube block.
  4. The game ends the moment all N×MN\times M cube blocks are stacked. After the game, if there is a horizontal row or a vertical row that is entirely blue, the first player wins. If not, the second player wins.

Junhyeok lets Minjae choose whether to be the first or second player. However, Junhyeok is strict. He will teach the algorithm only if Minjae wins all TT games, which are played independently. For each game, given NN and MM, output which side Minjae must choose to win. Assume both players are skilled and always play optimally.

Input

The first line contains an integer T(1≤T≤106)T(1 \leq T \leq 10^6), the number of games.

Each of the next TT lines contains two integers N(1≤N≤1018)N(1 \leq N \leq 10^{18}) and M(1≤M≤1018)M(1 \leq M \leq 10^{18}), separated by a space, which describe the conditions of one game.

Output

For each game, print on its own line the side Minjae must choose under the given conditions. Print the answer for the KK-th game on the KK-th line.

Print First if Minjae must choose the first player, and Second if he must choose the second player.

Hint

The construction of the Robot Convergence Hall was actually carried out by robots. The game in the problem has nothing to do with the real construction of the building.

Examples1

  1. Example 1

    Input
    3
    1 3
    2 6
    4 6
    
    Expected output
    First
    First
    Second