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: Accepted)

//
// Created by Hideaki Imamura on 2020-03-16.
//
# include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair <ll, ll> l_l;
typedef pair<int, int> i_i;

template<class T>
inline bool chmax(T &a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
inline bool chmin(T &a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

# define EPS (1e-7)
# define INF (1e9)
# define PI (acos(-1))
//const ll mod = 1000000007;

int N, K;
int a[110], dp[100100];

int main() {
    cin >> N >> K;
    for (int i = 0; i < N; ++i) cin >> a[i];

    // dp[j] = k個の石からなる山で、先手が勝つかどうか
    for (int k = 0; k <= K; ++k) {
        // lose = k に対して負け状態がいくつあるか
        // counter = k に対して遷移先がいくつあるか
        int lose = 0, counter = 0;
        for (int i = 0; i < N; ++i) {
            if (0 <= k - a[i]) {
                counter++;
                if (!dp[k - a[i]]) lose++;
            }
            // 遷移先が１つもないなら負けとする
            if (counter == 0) dp[k] = 0;
            // 遷移前に１つでも負け状態があるなら、勝ちとする
            else if (lose > 0) dp[k] = 1;
            // 遷移前が全て勝ち状態なら、負けとする
            else dp[k] = 0;
        }
    }

    if (dp[K]) cout << "First" << endl;
    else cout << "Second" << endl;
    return 0;
}