#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
    int a[110];
    int dp[N];
     
    int f(int n,int k) {
    	if (dp[n] != 0)
    		return dp[n];
    	for (int j = 0; j < k; j++)
    		if (n - a[j] >=0) {
    			if (f(n - a[j], k) == 2)
    				return dp[n] = 1;
    	return dp[n] = 2;
    }
    int main() {
    	int n, k, min = 1;
    	cin >> k >> n;
    	dp[0] = 2;
    	for (int i = 0; i < k; i++) {
    		cin >> a[i];
    		dp[a[i]] = 1;
    		if (min < dp[i])
    			min = dp[i];
    	}
     
    	cout << (f(n , k) == 1 ? "First" : "Second");
    	cin >> n;
    	return 0;
    }