#include <iostream>
#include <algorithm>
using namespace std;

long long N, M, A[1 << 18];
bool used[1 << 18][2];
long long dp[1 << 18][2];

long long solve(long long pos, long long turn) {
	if (pos == N + 1) return 0;
	if (used[pos][turn] == true) return dp[pos][turn];
	used[pos][turn] = true;

	if (turn == 0) {
		if (A[pos] == 1) {
			long long v1 = solve(pos + 1, turn ^ 1);
			long long v2 = 1LL - M;
			dp[pos][turn] = v1 + v2;
		}
		else {
			long long w1 = solve(pos + 1, turn ^ 1) + (A[pos] - M);
			long long w2 = solve(pos + 1, turn ^ 0) + (A[pos] - 1LL) - (1LL - M);
			dp[pos][turn] = max(w1, w2);
		}
	}
	if (turn == 1) {
		if (A[pos] == 1) {
			long long v1 = solve(pos + 1, turn ^ 1);
			long long v2 = 1LL - M;
			dp[pos][turn] = v1 - v2;
		}
		else {
			long long w1 = solve(pos + 1, turn ^ 1) - (A[pos] - M);
			long long w2 = solve(pos + 1, turn ^ 0) - (A[pos] - 1LL) + (1LL - M);
			dp[pos][turn] = min(w1, w2);
		}
	}
	return dp[pos][turn];
}

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

	long long Answer = solve(1, 0);
	if (Answer > 0) cout << "First" << endl;
	else cout << "Second" << endl;
	return 0;
}