#include <bits/stdc++.h>
using namespace std ;
int a[100000] ,n ,k ;
bool dp[100000][2] , A[100000][2] ;

bool f(int i,int turn)
{
    if( i == 0 ) return false ;
    if( i < 0 ) return true ;
    if( A[i][turn] ) return dp[i][turn] ;

    for( int j = 0 ; j < n ; j++ )
    {
        if( f(i-a[j] , 1 - turn ) == false )
            return  dp[i][turn] = true ;
    }
    return dp[i][turn] = false ;

}

int main()
{
    ios_base :: sync_with_stdio(NULL) ;
    cin.tie(false) ;
    cin >> n >> k ;
    for(int i=0;i<n;i++) {
        cin >> a[i] ;
        A[i][0] = A[i][1] = false ;
    }

    if( f(k,0) ) cout << "First" ;
    else cout << "Second" ;

    return 0;
}
