#include <bits/stdc++.h>

#define rep(i, n) for(int i = 0; i < n; i++)

typedef long long ll;
using namespace std;
int mod = 1000000007;

int main(void){
    int N; cin >> N;
    ll K; cin >> K;
    int A[N]; rep(i, N) cin >> A[i];
    bool dp[K+1] = {};
    for(int i = 2; i <= K; i++){
        bool res = false;
        rep(j, N){
            int val = i - A[j];
            if(val < 0) break;
            if(!dp[val]) res = true; //遷移によって負け局面に遷移できる
        }
        dp[i] = res;
    }
    if(dp[K]) cout << "First" << endl;
    else cout << "Second" << endl;
    return 0;
}