#include <bits/stdc++.h>
using namespace std ;

typedef long long ll ; 
typedef unsigned long long ull ; 
typedef vector<int> vi ; 
typedef vector<vi> vii ;
typedef vector<ll> vl ;
typedef vector<vl> vll ;
typedef set<int> si ; 
typedef map<int,int> mii ; 
typedef map<ll,ll>  mll ; 
typedef map<string,int> msi ;
typedef set<ll> sl ; 
typedef set<char> sc ; 
typedef pair<int,int> pii ;


#define REP(i,n) for(int i=0;i<(n);i++)
#define FOR(i,a,b) for(int i=(a);i<=(b);i++)
#define FORD(i,a,b) for(int i=(a);i>=(b);i--)
const int INF = 1 << 29 ; 
#define MOD (ll)(1e9+7)
#define eps 1e-6
#define pb push_back 
#define mp make_pair 
#define DEBUG(x)		cout << '>' << #x << ':' << x << endl;
#define F first 
#define S second 

int main() 
{
	ios::sync_with_stdio(0) ;
	

	int n ;
	cin >> n ;
	int k ;
	cin >> k;
	int a[n];
	REP(i,n) cin >> a[i];
	int dp[k+5];
	REP(i,k+5) dp[i] = -1 ;
	dp[0] = 1;
	for(int i = 0; i < n; ++i) {
		dp[a[i]] = 1;
	}
	sort(a , a + n);
	for(int i = 1; i <= k; ++i) {
		if(dp[i] == -1) {
			for(int j = 0; j < n; ++j) {
				if(i - a[j] < 0) break;
				if(dp[i-a[j]] == 1 && dp[i] != 1) {
					dp[i] = 0; 
				}
				if(dp[i-a[j]] == 0) {
					dp[i] = 1;
					break;
				}
			}
		}
	}
	if(dp[k] == 1) {
		cout << "First\n";
	}
	else {
		cout << "Second\n"
	}
	return 0 ; 
}
