Two persons play the following game. On the table are two stacks of coins. Players take turns. During the course of the player can take any non-zero number of coins from all over the pile, or take some of the same non-zero number of coins from the two stacks at once. Losing someone who can not make the next move.
Given the initial number of coins in the pile. Required to determine who will win at optimum game.
In a single line of input contains integers C_1 and C_2 (1 ≤ C_1, C_2 ≤ 7^77) — the number of coins in the pile.
The output file output First, if the first player wins, or Second, if you win the second.