#include <bits/stdc++.h>
using namespace std;

long long p[2];

int main() {
    int N;
    long long M;
    cin >> N >> M;
    vector<long long> A(N);
    for (int i = 0; i < N; i++) cin >> A[i];

    bool f = M == 0;
    for (int i = 0; i < N; i++) f &= A[i] == 2;
    if (f) {
        cout << "First" << endl;
        return 0;
    }

    int a = 0;
    for (int i = 0; i < N; i++) {
        if (A[i] > 1) {
            p[a] += A[i] - 1;
            p[a^1] += 1 - M;
        } else {
            p[a] += 1 - M;
            a ^= 1;
        }
    }

    if (p[0] > p[1]) cout << "First" << endl;
    else cout << "Second" << endl;
}