There are piles of stones. The -th pile initially contains stones. An integer is also given.
The first and second players alternate turns, starting with the first player. On each turn, the player performs the following move.
A player who cannot make a move loses. Determine the winner when both players play optimally.
The input is given in the following format:
For each test case, print First if the first player wins, or Second if the second player wins.
Each test case is given in the following format: