#include <bits/stdc++.h>
using namespace std;
#define modulo 1000000007
#define mod(mod_x) ((((long long)mod_x+modulo))%modulo)
#define Inf 1000000000

int main(){
	
	int N;
	cin>>N;
	
	long long M;
	cin>>M;
	
	vector<long long> A(N);
	for(int i=0;i<N;i++)scanf("%lld",&A[i]);
	
	vector<long long> p(2,0LL);
	
	int now = 0;
	int t = 0;
	
	while(now!=N){
		if(A[now]==1){
			p[t] -= M;
			p[t] ++;
			now++;
		}
		else{
			p[t] += A[now]-1;
			A[now] = 1;
		}
		t^=1;
	}
	
	if(p[0]>p[1])cout<<"First"<<endl;
	else cout<<"Second"<<endl;
	
	return 0;
}