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

long long INF = 1000000000000000000;

long long N, M;
vector<long long> A;
vector<vector<long long> > DP;

long long DFS(long long X, int Y) {
	if (X == N) return 0;
	if (DP[X][Y] != -INF) return DP[X][Y];
	if (Y == 0) {
		if (A[X + 1] == 1) return DP[X][Y] = -DFS(X + 1, 0) + 1 - M;
		else return DP[X][Y] = -DFS(X + 1, 1) + 1 - M;
	}
	else {
		DP[X][Y] = max(DP[X][Y], -DFS(X, 0) + A[X] - 1);
		if (A[X + 1] == 1) DP[X][Y] = max(DP[X][Y], -DFS(X + 1, 0) + A[X] - M);
		else DP[X][Y] = max(DP[X][Y], -DFS(X + 1, 1) + A[X] - M);
		return DP[X][Y];
	}
}

int main() {
	cin >> N >> M;
	A.resize(N + 1);
	for (int i = 0; i < N; i++) cin >> A[i];
	A[N] = 1;
	DP.assign(N, vector<long long>(2, -INF));
	if (A[0] == 1) {
		DFS(0, 0);
		cout << (DP[0][0] > 0 ? "First" : "Second") << endl;
	}
	else {
		DFS(0, 1);
		cout << (DP[0][1] > 0 ? "First" : "Second") << endl;
	}
}