// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

typedef long long int ll;

const int MAX=1e5 + 10,MOD=1e9 + 7;

int N,K,A[105],mn=1e9;

int dp[MAX][2];

int f(int rem,int turn)

{

    if(rem<mn&&turn==1)return 0;

    if(rem<mn&&turn==0)return 1;

    if(dp[rem][turn]!=-1)return dp[rem][turn];

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

    {

        if(rem-A[i]>=0)

        if(f(rem-A[i],turn^1)==turn){

            return dp[rem][turn] = turn;

        }

    }

    return dp[rem][turn] = turn^1;

}

int main ()

{

    ios_base::sync_with_stdio(false);

    cin.tie(0);



    memset(dp,-1,sizeof dp);

    cin >> N >> K;

    for(int i=0;i<N;i++){cin>>A[i];mn = min(mn,A[i]);}

    if(f(K,0)==0){

        cout<<"First\n";

    }

    else cout<<"Second\n";

    //main();

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 1.9109586879158644x):


/**

    And in the end, the love you take is equal to the love you make.



        I LOVE YOU LAURA.

**/



#include <bits/stdc++.h>

#include <ext/pb_ds/assoc_container.hpp>

#include <ext/pb_ds/tree_policy.hpp>

#include <ext/rope>



#define _CRT_SECURE_NO_DEPRECATE

#define _CRT_DISABLE_PERFCRIT_LOCKS



#define findOrder find_by_order

#define orderKey order_of_key



#define isOn(mask, i) (mask & (1 << i))

#define turn(mask, i) (mask |= (1 << i))

#define switch(mask, i) (mask &= ~(1 << i))

#define change(mask, i) (mask ^= (1 << i))

#define lowbit(mask) (mask & (-mask))

#define turnAll(mask, n) (mask = (1 << n) - 1)

#define switchLastBit(mask) (mask & (mask - 1))

#define turnLastZero(mask) (mask | (mask + 1))

#define modulo(x, mod) ((x) & (mod - 1))

#define log2(x) (31 - __builtin_clz(x))



#define mkp make_pair

#define pb push_back

#define pf push_front

#define eb emplace_back

#define ef emplace_front

#define ins insert

#define rsz resize

#define f first

#define s second

#define lb lower_bound

#define ub upper_bound



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

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

#define rall(x) rbegin(x), rend(x)



#define debug(x) (cerr << x << " ")



using namespace std;

using namespace __gnu_pbds;

using namespace __gnu_cxx;



typedef double db;

typedef long long ll;

typedef long double ld;

typedef unsigned long long ull;



typedef pair<int, int> ii;

typedef pair<ll,ll> pll;

typedef pair<ld,ld> pdb;

typedef pair<int, ii> tri;

typedef complex<ld> cd;



typedef vector<int> vi;

typedef vector<ii> vii;

typedef vector<ld> vdb;

typedef vector<cd> vcd;

typedef vector<ll> vll;

typedef vector<string> vs;

typedef vector<vll> matrix;



typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_tree;



const ll mod = 1e9+7;

const int maxn = 1e5+2;

const int pi = 2 * acos(0.0);

const db eps = 1e-9;



int arr[105], dp[maxn];



int main()

{

    ios_base::sync_with_stdio(0);

    cin.tie(0); cout.tie(0);



    int n, k; cin >> n >> k;



    for (int i = 1; i <= n; i++){

        cin >> arr[i];

    }



    sort(arr + 1, arr + 1 + n);



    dp[0] = 0;

    for (int mov = 1; mov <= k; mov++){

        for (int i = 1; i <= n; i++){

            if (arr[i] > mov) break;



            if (dp[mov - arr[i]] == 0){

                dp[mov] = 1;

            }

        }

    }



    cout << ((dp[k] == 1) ? "First\n" : "Second\n");



    return 0;

}