Problem:
Score : 100 points

Problem Statement

There 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

Input

Input is given from Standard Input in the following format:

N K
a_1 a_2 \ldots a_N

Output

If Taro will win, print First; if Jiro will win, print Second.

Sample Input 1

2 4
2 3

Sample Output 1

First

If Taro removes three stones, Jiro cannot make a move.
Thus, Taro wins.

Sample Input 2

2 5
2 3

Sample Output 2

Second

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 3

2 7
2 3

Sample Output 3

First

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 4

3 20
1 2 3

Sample Output 4

Second

Sample Input 5

3 21
1 2 3

Sample Output 5

First

Sample Input 6

1 100000
1

Sample Output 6

Second

Solution in C++14 (GCC 5.4.1) (judge verdict: Runtime Error)

#include <bits/stdc++.h>
using namespace std;
#define REP(i,a) for(int i = 0; i < (a); i++)
#define ALL(a) (a).begin(),(a).end()
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const long long LINF = 1e18;
const long long MOD = 1e9 + 7;

#define MAX_N 100
#define MAX_K 100000

int n,k;
int a[MAX_N];
int dp[2][MAX_K + 1];

int rec(int turn, int k){
    if(dp[turn][k] != -1) return dp[turn][k];
    REP(i,n){
        if(k - a[i] >= 0) goto ok;
    }
    return dp[turn][k] = (turn == 1) ? 0 : 1;
    ok:;
    if(turn){
        REP(i,n){
            if(rec(!turn, k - a[i]) == 1) return dp[turn][k] = 1;
        }
        return dp[turn][k] = 0;
    }else{
        REP(i,n){
            if(rec(!turn, k - a[i]) == 0) return dp[turn][k] = 0;
        }
        return dp[turn][k] = 1;
    }
}

signed main(){
    cin >> n >> k;
    REP(i,n){
        cin >> a[i];
    }
    memset(dp, -1, sizeof(dp));
    if(rec(true, k) == 1) cout << "First" << endl;
    else cout << "Second" << endl;
    return 0;
}