#include <bits/stdc++.h>
//#include <chrono>
//#pragma GCC optimize("Ofast")
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()
#define fi first
#define se second
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;

ll N,M,H,W,Q,K,A,B;
string S;
typedef pair<ll, ll> P;
const ll INF = (1LL<<58);

int main() {
    cin>>N>>M;
    vec a(N);
    rep(i,N) cin>>a[i];
    reverse(ALL(a));
    vec now(2, 0), nxt(2);
    rep(i,N){
        if(a[i] != 1) {
            nxt[0] = max(a[i] - M + now[1], a[i] - 1 + now[0]);
            nxt[1] = min(now[0], 1LL - M + now[1]);
        }else{
            nxt[0] = 1LL - M + now[1];
            nxt[1] = now[0];
        }
        swap(now, nxt);
    }
    ll total = accumulate(ALL(a), 0LL) - N * M, Fscore = now[0];
    cout<<(Fscore > total - Fscore ? "First" : "Second")<<endl;
}