#include <bits/stdc++.h>
using namespace std;
int n, k;
int a[105];
int dp[100005][2];

int solve(int i, int ok) {
    if (dp[i][ok] != -1) return dp[i][ok];
    int cur;
    if (ok == 0) cur = 1;
    else cur = 0;
    if (ok == 0) {
        for (int j = 1; j <= n; j++)
            if (i >= a[j])
                cur = min(cur, solve(i - a[j], 1 - ok));
    } else {
        for (int j = 1; j <= n; j++)
            if (i >= a[j])
                cur = max(cur, solve(i - a[j], 1 - ok));
    }
    return dp[i][ok] = cur;
}

main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    freopen("TEST.inp", "r", stdin);
    freopen("TEST.out", "w", stdout);
    cin >> n >> k;
    for (int i = 1; i <= n; i++) cin >> a[i];

    memset(dp, -1, sizeof(dp));

    if (solve(k, 0) == 0) cout << "First" << '\n';
    else cout << "Second" << '\n';

    return 0;
}