#include <bits/stdc++.h>
using namespace std;
int n,k;
int  mn;
int solve(int s, int a[], int dp[])
{  
    if(s<mn) return -1;
    if(dp[s]) return dp[s];
    
    for(int i=0;i<n;++i)
        {   int temp=solve(s-a[i],a,dp);
            if(temp==-1)
                {dp[s]=1;return dp[s];}
            else if(temp==1)
                {dp[s]=-1;continue;}
 
        }
        return dp[s];
}

int main()
{
    cin>>n>>k;
    int dp[k+1]={0};
    int a[k+1];
    cin>>a[0];mn=a[0]; 
    for(int i=1;i<n;++i)
        {cin>>a[i];mn=min(a[i],mn );}
    //cout<<mn<<" \n";cout<<s<<" "<<p<<" "<<dp[s][p]<<"\n"; cout<<s<<" "<<p<<"\n ";
    if(solve(k,a,dp)==1) cout<<"First\n";
    else cout<<"Second\n";
        
}

