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

int main() {
	int N,K;
	cin>>N>>K;
    vector<int> S(N);
    for (int i=0;i<N;i++) cin>>S[i];
    vector<bool>dp(K+1);
	for (int stones=0;stones<=K;stones++){
		for (int x:S){
			if(stones>=x and !dp[stones-x]){
				dp[stones]=true;
			}
		}
	}
	puts(dp[K]?"First":"Second");
    return 0; 
}
