eolymp
bolt
Try our new interface for solving problems

Coins

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. \InputFile In a single line of input contains integers \textbf{C_1} and \textbf{C_2} (\textbf{1} ≤ \textbf{C_1}, \textbf{C_2} ≤ \textbf{7^77}) --- the number of coins in the pile. \OutputFile The output file output \textbf{First}, if the first player wins, or \textbf{Second}, if you win the second.
Time limit 9 seconds
Memory limit 256 MiB
Input example #1
1 1
Output example #1
First
Author Dmitriy Zhukov
Source Winter School, Kharkov, 2011, Day 2