#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(A) A.begin(),A.end()
using vll = vector<ll>;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
using Graph = vector<vector<ll>>;

ll gcd(ll(a), ll(b)) {
    ll c = a;
    while (a % b != 0) {
        c = a % b;
        a = b;
        b = c;
    }
    return b;
}

int main() {
    ll N,M;
    cin>>N>>M;
    vll A(N);
    rep(i,N)cin>>A[i];
    ll F=0;
    vll AN(2,0);
    rep(i,N){
        if(A[i]==1){
            AN[F]+=1;
            AN[F]-=M;
            F=1-F;
        }
        else{
            AN[F]+=A[i]-1;
            AN[1-F]+=(1-M);

        }
    }
    cout<<(AN[0]>AN[1]?"First":"Second")<<endl;

}