/**
   Solution by Abil
**/
# include <bits/stdc++.h>

# define fr first
# define sc second
# define pb push_back
# define mk make_pair
# define sz(s) s.size()
# define all(s) s.begin(),s.end()
# define int long long

using namespace std;

const long long N = (1e6 + 10);
const long long mod = (1e9 + 7);
const long long inf = (1e9 + 7);

int arr[N],dp[100001][1001];
main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);

    int n, k;
    cin >> n >> k;
    for(int i = 1;i <= n; i++){
        cin >> arr[i];
        dp[1][i] = k - arr[i];
    }

    int i = 2;
    while(1){
        for(int j = 1;j <= n; j++){
            for(int l = 1;l <= n; l++){
                if(l == 1){
                    dp[i][j] = dp[i - 1][j] - arr[l];
                }
                dp[i][j] = max(dp[i][j],dp[i - 1][j] - arr[l]);
            }
            if(dp[i][j] < 0){
                cout << ((i % 2 == 0)?"First":"Second");
                return 0;
            }
        }
        i++;
    }


}
