#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define sz(x) (int)x.size()
#define int long long
typedef pair<int,int>pii;
const int mxN=1e5+5,M=1e9+7;
//did u check when n=1?
//is mxN correct?

int n,k;
int dp[2][mxN];
int v[105];
int solve(int p,int res){
    //cout<<p<<" "<<res<<"\n";
    if(res==0)
      return dp[p][res]=0;
    if(dp[p][res]!=-1)
      return dp[p][res];

    for(int i=0;i<n;i++){
        if(v[i]<=res && !solve((p+1)%2,res-v[i]))
        return dp[p][res]=1;
    }
    return dp[p][res]=0; 
}
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    memset(dp,-1,sizeof(dp));
    cin>>n>>k;
    for(int i=0;i<n;i++)cin>>v[i];
    solve(0,k);
    cout<<(solve(0,k)==1?"First":"Second");
    return 0;
}
