#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define MOD 1000000007
#define pii pair<int,int>
#define LL long long

using namespace std;

int n,k,a[105],dp[105][100005];
int solve(int x,int rem) {
    if (x==0&&rem>=0) return 0;
    if (rem<0) return -1*MOD;
    if (dp[x][rem]!=-1) return dp[x][rem];
    int ret=0;
    if (rem-a[x]>=0) ret=max(solve(x,rem-a[x])+1,ret);
    ret=max(ret,solve(x-1,rem));
    return dp[pos][rem]=ret;
}

int main () {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    cin >> n >> k;
    for (int i=1;i<=n;i++) cin >> a[i];
    memset (dp,-1,sizeof(dp));
    int ans=solve(n,k);
    if (ans%2==1) cout << "First" << endl;
    else cout << "Second" << endl;
    return 0;
}
