#include<iostream>
#include<string>
#include<iomanip>
#include<cmath>
#include<vector>
#include<algorithm>
#include<utility>
#include<cassert>

using namespace std;

#define int long long
#define endl "\n"

constexpr long long INF = (long long)2e18;
constexpr long long MOD = 1'000'000'007; 

struct fast_io {
	fast_io(){
		std::cin.tie(nullptr);
		std::ios::sync_with_stdio(false);
	};
} fio;

signed main(){
	cout<<fixed<<setprecision(10);
	
    int N, M;
    vector<int> A;
    vector<int> B;
	bool flag = true;
	int ans = 0;
	
    cin>>N>>M;
    
	// assert(M > 0);
	
	A.resize(N);
	B.resize(N+1);
	
    for(int i = 0; i < N; i++){
		cin>>A[i];
		
		if(A[i] == 1) B[i] = 1;
    }
	
	for(int i = N-2; i >= 0; i--){
		if(B[i+1] && B[i]) B[i] += B[i+1];
	}
	
	for(int i = 0; i < N; i++){
		if(A[i] == 1) {
			if(flag) {
				ans += (1 - M);
			} else {
				ans -= (1 - M);
			}
			
			flag = !flag;
			
		} else {
			if(B[i+1] + i + 1 == N) {
				if(flag) {
					ans += max((A[i] - M) +  (B[i+1]) / 2 * (1 - M) -  (B[i+1]+1) / 2 * (1 - M), 
					 (A[i] - 1) - (1 - M) - (B[i+1]) / 2 * (1 - M) +  (B[i+1]+1) / 2 * (1 - M));
					break;
				} else {
					ans -= max((A[i] - M) +  (B[i+1]) / 2 * (1 - M) -  (B[i+1]+1) / 2 * (1 - M), 
					 (A[i] - 1) - (1 - M) - (B[i+1]) / 2 * (1 - M) +  (B[i+1]+1) / 2 * (1 - M));
					break;
				}
			} else {
				
				if(B[i+1]%2) {
					if(flag) {
						ans += (A[i] - M);
					} else {
						ans -= (A[i] - M);
					}
					
					flag = !flag;
				} else {
					if(flag) {
						ans += (A[i] - 1);
						ans -= (1 - M);
					} else {
						ans -= (A[i] - 1);
						ans += (1 - M);
					}
				}
			
			}
		}
	}
	
	if(ans <= 0) cout<<"Second"<<endl;
	else cout<<"First"<<endl;
	 
	return 0;
}