#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e18;
const int inf = 1e9;
double pi = 3.14159265359;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define per(i, b, a) for (int i = a - 1; i >= b; i--)
using Graph = vector<vector<int>>;
using pint = pair<int, int>;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
int dxx[8] = {1, 1, 1, 0, 0, -1, -1, -1}, dyy[8] = {-1, 0, 1, -1, 1, -1, 0, 1};
//解説AC
int main() {
    int n, k;
    cin >> n >> k;
    int a[n];
    rep (i, 0, n) cin >> a[i];
    bool dp[k + 1] = {}; // dp[i]：i個残りの時先手が勝てるか
    rep (i, 1, k + 1) {
        rep (j, 0, n) {
            if (i > a[j]) dp[i] |= !dp[i - a[j]];
        }
    }
    cout << (dp[k] ? "First" : "Second") << "\n";
}
