// Slower C++ solution:
#include<set>

#include<map>

#include<cmath>

#include<ctime>

#include<queue>

#include<stack>

#include<cstdio>

#include<string>

#include<vector>

#include<random>

#include<cstdlib>

#include<cstring>

#include<iomanip>

#include<iostream>

#include<algorithm>

#include<unordered_map>

#define endl "\n"

#define fi first

#define se second

#define db double

#define gcd __gcd

#define pb push_back

#define mp make_pair

#define lowbit(x) (x & (-x))

#define PII  pair<int, int> 

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

#define debug(x) cout << #x << " = " << x << endl

#define rep(i, a, b) for(__typeof(b) i = a; i <= (b); i++)

#define Rep(i, a, b) for(__typeof(a) i = a; i >= (b); i--)

#define FAST ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)

template<class T> inline T qmin(T a, T b) { return a < b ? a : b; }

template<class T> inline T qmax(T a, T b) { return a > b ? a : b; }

typedef long long ll;

typedef unsigned long long ull;

const db eps = 1e-9;

const db PI = acos(-1);

const int inf = 0x3f3f3f3f;

const int mod = (int)1e9 + 7;

const int maxn = (int)1e5 + 5;//remember to modify it, No RE or MLE

const ll INF = 0x3f3f3f3f3f3f3f3f;

using namespace std;



ll qpow(ll x, ll y) { ll ret = 1; for( ; y; y >>= 1, x = (x * x) % mod) if(y & 1) ret = (ret * x) % mod; return ret; }



inline int read(){

	char ch = getchar();

	int x = 0, f = 1;

	while(ch < '0' || ch > '9'){

		if(ch == '-') f = -1;

		ch = getchar();

	}

	while('0' <= ch && ch <= '9'){

		x = x * 10 + ch - '0';

		ch = getchar();

	}

	return x * f;

}



int dp[maxn];//0 必败态; 1必胜态; -1尚未确定;

int a[105];

int n, k;

int cnt = 0;



bool dfs(int now){

	if(~dp[now]) return dp[now];

	bool ret = 0;

	rep(i, 1, n){

		if(a[i] > now) break;

		if(!dfs(now - a[i])) ret = 1;

	}

	return dp[now] = ret;

}



int main()

{

	n = read(), k = read();

	rep(i, 1, n) a[i] = read();

	memset(dp, -1, sizeof dp);

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

	dp[0] = 0;

	dfs(k);

	puts(dp[k] ? "First" : "Second");

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 1.4512473661653789x):
//by Top1

#include <bits/stdc++.h>

     

#define f first

#define s second

#define int long long

#define ld long double

#define ull unsigned long long

#define pii pair <int, int>

#define pll pair <long, long>

#define mp make_pair

#define pb push_back

#define pf push_front

#define pp pop_back

#define rev reverse

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

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

#define forn(i, a, b) for (int i = a; i <= b; i++)

#define boost ios_base::sync_with_stdio(false); cin.tie(0),cout.tie(0);

#define nxtp next_permutation

#define pvtp prev_permutation

#define KZ return 

#define x1 x21212121

#define y1 y21212121

#define sqr(x) x * x 

 

const int inf = (1e9) + 1;

const int mod = 1e9 + 7;

const int maxn = 2e5 + 111;

     

using namespace std;



int n, q, a[maxn], dp[maxn], k, mn = inf;

                           

void solve(){

	cin >> n >> k;



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

    	cin >> a[i];

    	mn = min(mn, a[i]);

    }



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



   	for (int i = mn; i <= k; i++){

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

   			if (i - a[j] >= 0){

   				if (dp[i - a[j]] == 0)

   					dp[i] = 1;

   			}

   			else

   				break;

   		}

   	}



   	if (dp[k] == 1)

   		cout << "First";

   	else

   		cout << "Second";

}



main(){

    boost;

	    

	q = 1;



	while (q--){

		solve();

	}

}