#include <bits/stdc++.h>

using namespace std;
#define ll  long long
#define ld long double
ll a[100005]={0};
ll n,k;
ll hod[105]={0};
ll rec(ll k) {
    if(a[k]!=-1) return a[k];
  bool b[105];
  for(ll i =0;i<=105;i++) {
    b[i] = 0;
  }
    for(ll i =1;i<=n;i++) {
            if(hod[i]<=k)
        b[rec(k-hod[i])] = 1; else break;
    }
    for(ll i =0;i<=105;i++) {
        if(!b[i]) {a[k] = i; delete b; return i;}
    }

}
int main()
{
 // freopen("input.txt","r",stdin);
 //  freopen("output.txt","w",stdout);
    cin.tie(0);
    cout.tie(0);
    ios_base::sync_with_stdio(false);

    cin>>n>>k;
    for(ll i =1;i<=k;i++) {
        a[i] = -1;
    }
    for(ll i =1;i<=n;i++) {
        cin>>hod[i];
    }
    stable_sort(hod+1,hod+1+n);
a[0] = 0;
if(rec(k)==0) cout<<"Second"; else cout<<"First";

}

