#include <iostream>

using namespace std;
typedef long long ll;
ll a[200010],m,dp[200010];
int main(){
    int i,n; cin >> n >> m;
    for(i=0;i<n;i++) cin >> a[i];
    dp[n] = 0;
    for(i=n - 1;i>=0;i--){
        if(a[i]>1) dp[i] = max(a[i] - m - dp[i + 1],a[i] + m + dp[i + 1]);
        else dp[i] = 1 - m - dp[i + 1];
    }
    if(dp[0]>0) cout << "First" << endl;
    else cout << "Second" << endl;
}