#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using pii = pair<int, int>;
constexpr ll INF = 1ll<<30;
constexpr ll longINF = 1ll<<60;
constexpr ll MOD = 1000000007;
constexpr bool debug = false;
//---------------------------------//

int main() {
	int N;
	ll M;
	cin >> N >> M;
	vector<ll> A(N);
	REP(i, N) scanf("%lld", &A[i]);
	
	vector dp(N + 1, vector(2, 0ll)); // [i][j] := 残り i 個, j(1:現在先手, 0:後手) のときの 先手-後手
	dp[0][0] = dp[0][1] = 0;
	REP(i, N) {
		const int c = N - 1 - i;
		{ // 先手
			ll cur = A[c] - M + dp[i][0];
			if (A[c] > 1) chmax(cur, A[c] - 1 - (1 - M) + dp[i][1]);
			dp[i + 1][1] = cur;
		}
		{ // 後手
			ll cur = -(A[c] - M) + dp[i][1];
			if (A[c] > 1) chmin(cur, 1 - M - (A[c] - 1) + dp[i][0]);
			dp[i + 1][0] = cur;
		}
	}
	
	if (dp[N][1] > 0) puts("First");
	else puts("Second");
}