/**
 *    author:  otera    
**/
#include<iostream>
#include<string> 
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm> 
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<cassert>
using namespace std;

#define int long long
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
typedef long double ld;
const int inf=1e9+7;
const ll INF=1LL<<60 ;
const ll mod=1e9+7 ;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<int, int> P;
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;
#define fr first
#define sc second
#define all(c) c.begin(),c.end()
#define pb push_back
#define debug(x)  cerr << #x << " = " << (x) << endl;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

P dp[200200][2];

int n, m; 
vector<int> a;

P dfs(int i, int k) {
	if(dp[i][k] != P{-INF, -INF}) return dp[i][k];
	if(i == n) return P{0, 0};
	P res1 = dfs(i + 1, 0), res2 = dfs(i + 1, 1);
	if(k == 0) {
		if(a[i] == 1) {
			dp[i][k] = P{res2.fr + 1 - m, res2.sc};
		} else {
			if(res1.fr + a[i] - 1 > res2.fr + a[i] - m) {
				dp[i][k] = P{res1.fr + a[i] - 1, res1.sc + 1 - m};
			} else {
				dp[i][k] = P{res2.fr + a[i] - m, res2.sc};
			}
		}
	} else {
		if(a[i] == 1) {
			dp[i][k] = P{res1.fr, res1.sc + 1 - m};
		} else {
			if(res2.sc + a[i] - 1 > res1.sc + a[i] - m) {
				dp[i][k] = P{res2.fr + 1 - m, res2.sc + a[i] - 1};
			} else {
				dp[i][k] = P{res1.fr, res1.sc + a[i] - m};
			}
		}
	}
	return dp[i][k];
}

void solve() {
	cin >> n >> m;
    a.resize(n);
	rep(i, n) {
		cin >> a[i];
	}
	rep(i, n + 1) {
		rep(j, 2) {
			dp[i][j] = P{-INF, -INF};
		}
	}
	cout << (dfs(0, 0).fr > dfs(0, 0).sc ? "First" : "Second") << endl;
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(10);
	//int t; cin >> t; rep(i, t)solve();
	solve();
    return 0;
}