stablegradients/pie-gem5-pairs huggingface dataset:
// 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.497237492995028x):
#include <bits/stdc++.h>



using namespace std;

typedef long long ll;



const int N = 100007;



bool f[N];

int a[1007];

int main() {

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



    for(int i = 0; i < n; ++i) cin >> a[i];



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

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

            if(i - a[j] >= 0) f[i] = f[i] or (!f[i - a[j]]);

        }

    }



    cout << (f[k]? "First" : "Second") << endl;

}
// 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.931059195991293x):
#include<bits/stdc++.h>

#define ull unsigned long long

#define ll long long

#define pb push_back

#define endl '\n'

#define line cout<<"----------------------"<<endl

#define mp make_pair

#define mod 1000000007

#define fast ios_base::sync_with_stdio(false); cin.tie(NULL)

#define filein freopen("input.txt","r",stdin)

#define fileout freopen("output.txt","w",stdout)

using namespace std;

const ll  mx=2000009;

ll  ara[101];

ll  ans[100009];

int main()

{

    ll  n,k;

    cin>>n>>k;

    for(ll  i=0;i<n;i++) cin>>ara[i];

    ans[0]=0;

    for(int i=1;i<=k;i++)

    {

        ll  maxi=INT_MAX;

        for(int j=0;j<n and ara[j]<=i;j++)

        {

            maxi=min(maxi,ans[i-ara[j]]);

        }

        if(maxi==0) ans[i]=1;



    }

    if(ans[k]) cout<<"First"<<endl;

    else cout<<"Second"<<endl;





}
// 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.4765352617594505x):
#include<bits/stdc++.h>

#define ull unsigned long long

#define ll long long

#define pb push_back

#define endl '\n'

#define line cout<<"----------------------"<<endl

#define mp make_pair

#define mod 1000000007

#define fast ios_base::sync_with_stdio(false); cin.tie(NULL)

#define filein freopen("input.txt","r",stdin)

#define fileout freopen("output.txt","w",stdout)

using namespace std;

const ll  mx=2000009;

ll  ara[101];

ll  ans[100009];

int main()

{

    ll  n,k;

    cin>>n>>k;

    for(ll  i=0;i<n;i++) cin>>ara[i];

    ans[0]=0;

    for(int i=1;i<=k;i++)

    {

        ll  maxi=INT_MAX;

        for(int j=0;j<n and ara[j]<=i;j++)

        {

            maxi=min(maxi,ans[i-ara[j]]);

        }

        if(maxi==0) ans[i]=1;



    }

    if(ans[k]) cout<<"First"<<endl;

    else cout<<"Second"<<endl;





}
// 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.754849342640872x):
#include<bits/stdc++.h>

using namespace std;

#define vb __int128

#define ll long long

#define ld long double

#define full(a) a.begin(),a.end()

#define stoink stack<ll>

#define vec vector <ll>

#define vg vector<vector<ll> >

#define vgw vector<vector<pair<ll,ll> >

#define pa pair<ll,ll>

#define mp make_pair

#define pb push_back

#define ff first

#define ss second

#define pre 0.00000000000000000001

#define inf 1000000000000

#define mod 998244353

vec arr;

ll n;

vector<int> dp;

bool func(ll val) {

	if(val <= 0)

		return 0;

	if(dp[val] != -1)

		return dp[val];

	bool res = 0;

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

		if(arr[i] <= val) {

			int temp = func(val - arr[i]);

			if(temp == 0)

				res = 1;

		}

	}

	return dp[val] = res;



}

int main()

{	ios_base::sync_with_stdio(false);

	cin.tie(NULL);

	cout.tie(NULL);

	ll k,i;

	cin >> n >> k;

	arr.resize(n);

	dp.resize(k+1,-1);

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

		cin >> arr[i];

	if(func(k))

		cout << "First";

	else

		cout << "Second";

	return 0;

}
// 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.3418008825744576x):
#include<bits/stdc++.h>

using namespace std;

#define vb __int128

#define ll long long

#define ld long double

#define full(a) a.begin(),a.end()

#define stoink stack<ll>

#define vec vector <ll>

#define vg vector<vector<ll> >

#define vgw vector<vector<pair<ll,ll> >

#define pa pair<ll,ll>

#define mp make_pair

#define pb push_back

#define ff first

#define ss second

#define pre 0.00000000000000000001

#define inf 1000000000000

#define mod 998244353

vec arr;

ll n;

vector<int> dp;

bool func(ll val) {

	if(val <= 0)

		return 0;

	if(dp[val] != -1)

		return dp[val];

	bool res = 0;

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

		if(arr[i] <= val) {

			int temp = func(val - arr[i]);

			if(temp == 0)

				res = 1;

		}

	}

	return dp[val] = res;



}

int main()

{	ios_base::sync_with_stdio(false);

	cin.tie(NULL);

	cout.tie(NULL);

	ll k,i;

	cin >> n >> k;

	arr.resize(n);

	dp.resize(k+1,-1);

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

		cin >> arr[i];

	if(func(k))

		cout << "First";

	else

		cout << "Second";

	return 0;

}
// 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.8844399904367697x):
#include<bits/stdc++.h>

using namespace std;



typedef long long int ll;

typedef pair<int,int> pi;

priority_queue<pi, vector<pi>, greater<pi> > pq; //min heap



ll mini(ll a,ll b){	return a<b?a:b;}

ll maxi(ll a,ll b){	return a>b?a:b;}

ll gcd(ll a,ll b){	if(b == 0)	return a;return gcd(b,a%b);}

ll binpow(ll n,ll x){	ll ans = 1;while(x){if(x & 1)	ans *= n;n *= n;x >>= 1;}return ans;}



int main()

{

    ios::sync_with_stdio(false);

    cin.tie(0);

    cout.tie(0);



    int n;

    cin>>n;

    int k;

    cin>>k;

    vector<int> sto(n+1,0);

    for(int i=1;i<=n;++i)   cin>>sto[i];



    vector<int> dp(k+1,0);



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

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

            if(i >= sto[j] && !dp[i-sto[j]])  dp[i] = 1;

        }

    }



    if(dp[k])  cout<<"First\n";

    else        cout<<"Second\n";



    return 0;

}
// 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.440889072859928x):
#include<bits/stdc++.h>

using namespace std;



typedef long long int ll;

typedef pair<int,int> pi;

priority_queue<pi, vector<pi>, greater<pi> > pq; //min heap



ll mini(ll a,ll b){	return a<b?a:b;}

ll maxi(ll a,ll b){	return a>b?a:b;}

ll gcd(ll a,ll b){	if(b == 0)	return a;return gcd(b,a%b);}

ll binpow(ll n,ll x){	ll ans = 1;while(x){if(x & 1)	ans *= n;n *= n;x >>= 1;}return ans;}



int main()

{

    ios::sync_with_stdio(false);

    cin.tie(0);

    cout.tie(0);



    int n;

    cin>>n;

    int k;

    cin>>k;

    vector<int> sto(n+1,0);

    for(int i=1;i<=n;++i)   cin>>sto[i];



    vector<int> dp(k+1,0);



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

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

            if(i >= sto[j] && !dp[i-sto[j]])  dp[i] = 1;

        }

    }



    if(dp[k])  cout<<"First\n";

    else        cout<<"Second\n";



    return 0;

}
// 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.609922230265864x):
#include <bits/stdc++.h>



#define TR 100001



using namespace std;



bool dp[TR], visited[TR];

int a[TR];

int n, k;





bool f(int q) {

	if(q < 0)

		return 0;

	if(visited[q])

		return dp[q];

	bool val = 0;

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

		val |= f(q - a[i]);

	dp[q] = !val;

	visited[q] = 1;

	return dp[q];

}



int main() {

	cin >> n >> k;

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

		cin >> a[i];

	memset(dp, 0, TR * sizeof(bool));

	if(!f(k))

		cout << "First"  << endl;

	else

		cout << "Second" << endl;

	return 0;

}
// 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.2309860550171783x):
#include <bits/stdc++.h>



#define TR 100001



using namespace std;



bool dp[TR], visited[TR];

int a[TR];

int n, k;





bool f(int q) {

	if(q < 0)

		return 0;

	if(visited[q])

		return dp[q];

	bool val = 0;

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

		val |= f(q - a[i]);

	dp[q] = !val;

	visited[q] = 1;

	return dp[q];

}



int main() {

	cin >> n >> k;

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

		cin >> a[i];

	memset(dp, 0, TR * sizeof(bool));

	if(!f(k))

		cout << "First"  << endl;

	else

		cout << "Second" << endl;

	return 0;

}
// 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.9173502478899203x):
#include<bits/stdc++.h>

using namespace std;



int main(){

	int N,K;

	cin>>N>>K;

	vector<int>stones(N);

	vector<int>dp(K+1,0);

	

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

		int v;

		cin>>v;

		stones[i] = v;

	}

 

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

		for(int j = 0; j < stones.size(); j++){

			if(stones[j] <= i){

				if(dp[i- stones[j]] == 0){

					dp[i] = 1;

				}

			}

		}

	}

	cout<<endl;

 

	if(dp[K] == 1){

		cout<<"First"<<endl;

	}

	else cout<<"Second"<<endl;

}