#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i ++)
#define irep(i,n) for (int i = (int)(n) - 1;i >= 0;--i)
using namespace std;
using ll = long long;
using PL = pair<ll,ll>;
using P = pair<int,int>;
constexpr int INF = 1000000000;
constexpr long long HINF = 1000000000000000;
constexpr long long MOD = 1000000007;// = 998244353;
constexpr double EPS = 1e-4;
constexpr double PI = 3.14159265358979;

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    int N;
    ll M;
    cin >> N >> M;
    vector<ll> A(N);
    rep(i,N) cin >> A[i];

    if (M == 0) {
        ll dp0 = 0,dp1 = 0;
        irep(i,N) {
            ll new0 = max(A[i] - 1 + dp0,A[i] + dp1);
            ll new1 = min(1 + dp1,dp0);
            swap(new0,dp0);
            swap(new1,dp1);
        }
        ll tot = 0;
        rep(i,N) tot += A[i];
        if (2*dp0 > tot) cout << "First" << '\n';
        else cout << "Second" << '\n';
        return 0;
    }

    ll f = 0,s = 0;
    int turn = 0;
    rep(i,N) {
        if (A[i] > 1) {
            if (turn == 0) {
                f += A[i] - 1;
                s += 1 - M;
            } else {
                s += A[i] - 1;
                f += 1 - M;
            }
        } else {
            if (turn == 0) {
                f += 1 - M;
            } else {
                s += 1 - M;
            }
            turn ^= 1;
        }
    }
    cout << (f > s ? "First" : "Second") << '\n';
    return 0;
}