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

int n, k;
int arr[109];
int dp[100009];


bool solve(int k) {
	if(k == 0)
		return false;
	
	if(dp[k] != -1) {
		return dp[k];
	}
	
	bool ans = false;
	bool curr;
	for(int i = 0 ; i < n; i++) {
		if(arr[i] > k) break;
		curr = !(solve(idx, k - arr[i]));
		ans |= curr;
	}
	
	return dp[k] = ans;
}

int main() {
	cin>>n>>k;
	memset(dp, -1, sizeof(dp));
	for(int i = 0; i < n; i++) 
		cin>>arr[i];
	sort(arr, arr + n);
	
	if(solve(0, k)) cout<<"First\n";
	else cout<<"Second\n";
	return 0;
}