{"raw_statement":[{"iden":"problem statement","content":"There are $N$ piles of pebbles. Initially, the $i$\\-th pile has $A_i$ pebbles.\nTakahashi and Aoki will play a game using these piles. They will alternately perform the following operation, with Takahashi going first, and the one who becomes unable to do so loses the game.\n\n*   Choose one or more piles, and remove the following number of pebbles from each chosen pile: $X$ pebbles if this operation is performed by Takahashi, and $Y$ pebbles if performed by Aoki. Here, a pile with an insufficient number of pebbles cannot be chosen.\n\nDetermine the winner of the game if both players play optimally."},{"iden":"constraints","content":"*   $1 \\leq N \\leq 2\\times 10^5$\n*   $1 \\leq X, Y \\leq 10^9$\n*   $1 \\leq A_i \\leq 10^9$"},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$ $X$ $Y$\n$A_1$ $A_2$ $\\cdots$ $A_N$"},{"iden":"sample input 1","content":"2 1 1\n3 3"},{"iden":"sample output 1","content":"First\n\nHere is one possible progression of the game.\n\n*   Takahashi removes $1$ pebble from both piles.\n*   Aoki removes $1$ pebble from the $1$\\-st pile.\n*   Takahashi removes $1$ pebble from the $1$\\-st pile.\n*   Aoki removes $1$ pebble from the $2$\\-nd pile.\n*   Takahashi removes $1$ pebble from the $2$\\-nd pile.\n\nNo matter how Aoki plays, Takahashi can always win, so the answer is `First`."},{"iden":"sample input 2","content":"2 1 2\n3 3"},{"iden":"sample output 2","content":"Second"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}