{"raw_statement":[{"iden":"problem statement","content":"There are $N$ piles of stones. Initially, the $i$\\-th pile contains $A_i$ stones. With these piles, Taro the First and Jiro the Second play a game against each other.\nTaro the First and Jiro the Second make the following move alternately, with Taro the First going first:\n\n*   Choose a pile of stones, and remove between $L$ and $R$ stones (inclusive) from it.\n\nA player who is unable to make a move loses, and the other player wins. Who wins if they optimally play to win?"},{"iden":"constraints","content":"*   $1\\leq N \\leq 2\\times 10^5$\n*   $1\\leq L \\leq R \\leq 10^9$\n*   $1\\leq A_i \\leq 10^9$\n*   All values in the input are integers."},{"iden":"input","content":"The input is given from Standard Input in the following format:\n\n$N$ $L$ $R$ \n$A_1$ $A_2$ $\\ldots$ $A_N$"},{"iden":"sample input 1","content":"3 1 2\n2 3 3"},{"iden":"sample output 1","content":"First\n\nTaro the First can always win by removing two stones from the first pile in his first move."},{"iden":"sample input 2","content":"5 1 1\n3 1 4 1 5"},{"iden":"sample output 2","content":"Second"},{"iden":"sample input 3","content":"7 3 14\n10 20 30 40 50 60 70"},{"iden":"sample output 3","content":"First"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}