#include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define mod 1000000007
using ll=long long;
const int INF=1000000000;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0},dy[]={0,1,0,-1};
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

struct IOSetup{
    IOSetup(){
        cin.tie(0);
        ios::sync_with_stdio(0);
        cout<<fixed<<setprecision(12);
    }
} iosetup;
 
template<typename T1,typename T2>
ostream &operator<<(ostream &os,const pair<T1,T2>&p){
    os<<p.first<<" "<<p.second;
    return os;
}
 
template<typename T>
ostream &operator<<(ostream &os,const vector<T>&v){
    for(int i=0;i<(int)v.size();i++) os<<v[i]<<(i+1==(int)v.size()?"":" ");
    return os;
}

template<typename T1,typename T2>
istream &operator>>(istream &is,pair<T1,T2>&p){
    is>>p.first>>p.second;
    return is;
}

template<typename T>
istream &operator>>(istream &is,vector<T>&v){
    for(T &x:v)is>>x;
    return is;
}


/*
a[i]-1個取る，1個残す
a[i]個取って-mのペナを受ける
しか候補がない，とかじゃないと解けないだろ
*/
signed main(){
    int n;ll m;cin>>n>>m;
    vector<ll> a(n);
    cin>>a;

    assert(m!=0);

    if(m==0){
        ll r=0;
        sort(ALL(a));reverse(ALL(a));
        rep(i,n)r+=(i%2?-a[i]:a[i]);
        if(r==0) cout<<"Second"<<endl;
        else cout<<"First"<<endl;
        return 0;
    }

    priority_queue<pair<ll,bool>> que;
    rep(i,n){
        if(a[i]!=1) que.push({a[i]-1,true});
        else        que.push({1-m,false});
    }
    ll res=0;
    int i=0;
    while(!que.empty()){
        auto [t,f]=que.top();que.pop();
        if(i%2)res-=t;
        else res+=t;
        if(f)que.push({1-m,false});
        i++;
    }
    if(res<=0)  cout<<"Second"<<endl;
    else        cout<<"First"<<endl;
    return 0;
}