// Slower C++ solution:
//  Created by conan1024hao in 2019.

//  Copyright © 2019 conan1024hao. All rights reserved.

//  専用ライブラリです、自由にコピーして構いません。

//  感谢看我的代码！Wechat:conan1024hao QQ:810396815

#pragma GCC optimize ("O3")

#include <iostream>

#include <iomanip>

#include <istream>

#include <ostream>

#include <sstream>

#include <iterator>

#include <vector>

#include <algorithm>

#include <queue>

#include <deque>

#include <list>

#include <stack>

#include <map>

#include <set>

#include <utility>

#include <cmath>

#include <cstdio>

#include <cstring>

#include <string>

#include <ctime>

#include <cctype>

#include <cstdlib>

#define INF 10e16

#define MOD 1000000007

#define rep(i, a, n) for (ll i = a; i < (ll)(n); i++)

#define fi first

#define se second

#define pb push_back

#define mp make_pair

#define eb emplace_back

#define mmax(x,y)(x>y?x:y)

#define mmin(x,y)(x<y?x:y)

#define chmax(x,y) x=mmax(x,y)

#define chmin(x,y) x=mmin(x,y)

#define all(x) (x).begin(),(x).end()

#define siz(x) (ll)(x).size()

#define PI acos(-1.0)

using namespace std;

//using Int=int_fast64_t;

typedef long long int ll;

typedef pair<ll,ll>Pll;

typedef pair<int,int>Pin;

long long GCD(long long a, long long b) { return b ? GCD(b, a%b) : a; }

long long LCM(long long a, long long b)  {return a/GCD(a,b)*b;}

int dx[8]={-1,0,1,0,1,1,-1,-1};

int dy[8]={0,-1,0,1,1,-1,1,-1};

char dir[4]={'u','l','d','r'};

ll cmp1(pair<ll,string>a,pair<ll,string> b){

        if(a.fi!=b.fi)

        return a.fi<b.fi;

        else

        return a.se<b.se;

}

//--------------------------------------------------------------------------

int MAX_N=306;

bool dp[100005][2];

 int n,k;vector<int>a(100005);

int dfs(int k,int t){

    if(dp[k][t]>0)

        return dp[k][t];

    int ans=0;

    for(int i=0;i<n;i++)

        if(k>=a[i])

            ans |= !dfs(k-a[i],!t);

    return dp[k][t]=ans;

}

//---------------------------------------------------------------------------

int main(){//問題をちゃんと見ろ!!!!!!!!!!!!!!!!!      llか??????????        memset()!!!!!!!!!!!!

    cin.tie(0);

    ios::sync_with_stdio(false);

    //-------------------------------

   cin>>n>>k;

    

    for(int i=0;i<n;i++)

        cin>>a[i];

    if(dfs(k,0)==0)

        cout<<"Second"<<endl;

    else

        cout<<"First"<<endl;

    //-------------------------------

    return 0;

}

//---------------------------------------------------------------------------


// Faster C++ solution for the same problem (measured speedup: 1.3669098273109621x):
#include <bits/stdc++.h>

using namespace std;



#define NDEBUG

#include <cassert>





typedef long long ll;

typedef long double Double;

typedef unsigned long long ull;

typedef pair<int,int> ii;

typedef pair<ll,ll> llll;

typedef pair<double,double> dd;



typedef vector<int> vi;

typedef vector<vector<int>> vvi;

typedef vector<ii> vii;

typedef vector<vector<ii>> vvii;

typedef vector<ll> vll;

typedef vector<vector<ll>> vvll;

typedef vector<llll> vllll;

typedef vector<bool> vb;

typedef vector<string> vs;

typedef vector<double> vd;

typedef vector<long double> vD;



#define sz(a)  int((a).size())

#define pb  push_back

#define eb  emplace_back

#define FOR(var,from,to) for(int var=(from);var<=(to);++var)

#define rep(var,n)  for(int var=0;var<(n);++var)

#define rep1(var,n)  for(int var=1;var<=(n);++var)

#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)

#define repC3(vari,varj,vark,n)  for(int vari=0;vari<(n)-2;++vari)for(int varj=vari+1;varj<(n)-1;++varj)for(int vark=varj+1;vark<(n);++vark)

#define ALL(c)  (c).begin(),(c).end()

#define RALL(c)  (c).rbegin(),(c).rend()

#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)

#define found(s,e)  ((s).find(e)!=(s).end())

#define mset(arr,val)  memset(arr,val,sizeof(arr))

#define mid(x,y) ((x)+((y)-(x))/2)

#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))

#define cons make_pair



template<class T> inline void amin(T & a, T const & b) { a = min(a, b); }

template<class T> inline void amax(T & a, T const & b) { a = max(a, b); }

template<typename X, typename T> auto vectors(X x, T a) { return vector<T>(x, a); }

template<typename X, typename Y, typename Z, typename... Zs> auto vectors(X x, Y y, Z z, Zs... zs) { auto cont = vectors(y, z, zs...); return vector<decltype(cont)>(x, cont); }





ll gcd(ll a, ll b) { while(a) swap(a, b%=a); return b; }



const ll MOD=1000000007LL;



ll ADD(ll x, ll y) { return (x+y) % MOD; }

ll SUB(ll x, ll y) { return (x-y+MOD) % MOD; }

ll MUL(ll x, ll y) { return x*y % MOD; }

ll POW(ll x, ll e) { ll v=1; for(; e; x=MUL(x,x), e>>=1) if (e&1) v = MUL(v,x); return v; }

ll DIV(ll x, ll y) { /*assert(y%MOD!=0);*/ return MUL(x, POW(y, MOD-2)); }



#define INTSPACE 12

char _buf[INTSPACE*1000000 + 3];



int loadint() {

    if (fgets(_buf, INTSPACE+3, stdin)==NULL) return 0;

    return atoi(_buf);

}



int loadvec(vector<int>& v, int N=-1) {

    if (N == 0) {

        v.clear();

        return 0;

    }

    if (N == -1) {

        N = loadint();

        if (N==0) return 0;

    }

    int bufsize = INTSPACE*N + 3;

    if (fgets(_buf, bufsize, stdin)==NULL) return 0;

    v.resize(N);



    int i=0;

    bool last = false;

    for (char *p=&_buf[0]; ;) {

        char *q = p;

        while (*q > ' ') ++q;

        if (*q == 0x0D || *q == 0x0A) last = true;

        *q = 0;

        v[i++] = atoi(p);

        if (last || i == N) break;

        p = q+1;

    }

    return i;

}

void read_cr() {

    fgets(_buf, 256, stdin);

}





int N, K;

vi a;

vi taro_mm, jiro_mm;



bool taro(int k);

bool jiro(int k);



bool taro(int k) {

    if (k == 0) return false;

    if (taro_mm[k] != -1) return taro_mm[k];

    for (int ai: a) {

        if (ai > k) continue;

        if (!jiro(k-ai)) return taro_mm[k] = true;

    }

    return taro_mm[k] = false;

}

bool jiro(int k) {

    if (k == 0) return false;

    if (jiro_mm[k] != -1) return jiro_mm[k];

    for (int ai: a) {

        if (ai > k) continue;

        if (!taro(k-ai)) return jiro_mm[k] = true;

    }

    return jiro_mm[k] = false;

}



int main() {

    scanf("%d%d", &N,&K); read_cr();

    a.resize(N);

    taro_mm.assign(K+1, -1);

    jiro_mm.assign(K+1, -1);

    loadvec(a, N);

    cout << (taro(K) ? "First":"Second") << endl;

    return 0;

}