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

string solve(vector<int> &moves, int k){

    bool dp[k+1];
    memset(dp,0,sizeof dp);

    for(int i=1;i<=n;i++){
        for(auto m : moves){
            if(m>i) continue;
            else if(dp[i-m]==0)
                dp[i] = 1;
        }
    }

    return dp[k] ? "First" : "Second";
}

int main() {
    
    int n,k;
    cin>>n>>k;

    vector<int> moves(n);
    for(int i=0;i<n;i++)
        cin>>moves[i];

    cout<<solve(moves,k);

    return 0;
}
