
Score : 100 points
Problem StatementThere is a set A = \{ a_1, a_2, \ldots, a_N \} consisting of N positive integers.
Taro and Jiro will play the following game against each other.
Initially, we have a pile consisting of K stones.
The two players perform the following operation alternately, starting from Taro:
Choose an element x in A, and remove exactly x stones from the pile.
A player loses when he becomes unable to play.
Assuming that both players play optimally, determine the winner.
Constraints
All values in input are integers.
1 \leq N \leq 100
1 \leq K \leq 10^5
1 \leq a_1 < a_2 < \cdots < a_N \leq K
InputInput is given from Standard Input in the following format:
N K
a_1 a_2 \ldots a_N
OutputIf Taro will win, print First; if Jiro will win, print Second.
Sample Input 12 4
2 3
Sample Output 1First
If Taro removes three stones, Jiro cannot make a move.
Thus, Taro wins.
Sample Input 22 5
2 3
Sample Output 2Second
Whatever Taro does in his operation, Jiro wins, as follows:
If Taro removes two stones, Jiro can remove three stones to make Taro unable to make a move.
If Taro removes three stones, Jiro can remove two stones to make Taro unable to make a move.
Sample Input 32 7
2 3
Sample Output 3First
Taro should remove two stones. Then, whatever Jiro does in his operation, Taro wins, as follows:
If Jiro removes two stones, Taro can remove three stones to make Jiro unable to make a move.
If Jiro removes three stones, Taro can remove two stones to make Jiro unable to make a move.
Sample Input 43 20
1 2 3
Sample Output 4Second
Sample Input 53 21
1 2 3
Sample Output 5First
Sample Input 61 100000
1
Sample Output 6Second
