#pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
#include<bits/stdc++.h>

using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define Would
#define you
#define please



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


	ll N, M;
	cin >> N >> M;

	ll A[200200], B[200200][2] = {};
	rep(i, N) cin >> A[i];

	for (int i = N - 1; i >= 0; i--) {
		if (A[i] > 1) {
			B[i][0] = max(B[i + 1][1] + A[i] - M, B[i + 1][0] + A[i] + M - 2);
			B[i][1] = min(B[i + 1][0] - A[i] + M, B[i + 1][1] - A[i] - M + 2);
		}
		else {
			B[i][0] = B[i + 1][1] + A[i] - M;
			B[i][1] = B[i + 1][0] - A[i] + M;
		}
	}

	if (B[0][0] > 0) co("First");
	else co("Second");


	Would you please return 0;
}