#include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//using namespace __gnu_pbds;
using namespace std;

#define ff              first
#define ss              second
#define int             long long
#define pb              push_back
#define mp              make_pair
#define pii             pair<int,int>
#define vi              vector<int>
#define mii             map<int,int>
#define pqb             priority_queue<int>
#define pqs             priority_queue<int,vi,greater<int> >
#define setbits(x)      __builtin_popcountll(x)
#define zrobits(x)      __builtin_ctzll(x)
#define mod             1000000007
#define inf             1e18
#define ps(x,y)         fixed<<setprecision(y)<<x
#define mk(arr,n,type)  type *arr=new type[n];
#define w(x)            int x; cin>>x; while(x--)
mt19937                 rng(chrono::steady_clock::now().time_since_epoch().count());

//typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;


void c_p_c()


int n;
int a[101] = {0};
int dp[100001][101] = {0};
priority_queue<int > p;
//int ans=-1;
void f(int i, int k) {
	// if (dp[k][i] != 0)
	// 	return dp[k][i];
	if (i == n) i = 1;
	if (k <= 0) return ;
	//int ans = 3;

	for (int i = 1; i <= n; i++) {
		int q = 0;
		if (k - a[i] >= 0) {
			q++;
			f(i + 1, k - a[i]);
			p.push(q % 2);

		}

	}
}
int32_t main() {

	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	int k;
	cin >> n >> k;

	for (int i = 1; i <= n; i++) {
		cin >> a[i];
	}
	f(1, k);
	int z = 0;
	while (!p.empty()) {
		if (p.top() == 1) {
			z = 1;
			break;
		}
		p.pop();
	}
	if (z == 1)
		cout << "First";
	else cout << "Second";
	return 0;
}