#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<functional>
#include<math.h>
using namespace std;
//#define N (1000000000+7)
#define N (998244353)
#define INF 1e16
typedef long long ll;
typedef pair<int,int> P;

ll inv(ll x,ll power) {
	ll res = 1;
	ll k = power;
	ll y = x%N;
	while (k) {
		if (k & 1)res = (res*y) % N;
		y = (y%N*y%N) % N;
		k /= 2;
	}
	return res;
}


int main(void){
    ll n,m;
    cin>>n>>m;
    vector<ll>a(n);
    for(int i=0;i<n;i++)cin>>a[i];
    ll First = 0,Second = 0,parity = 0;
    for(int i=0;i<n;){
        if(a[i]==1){
            if(i==n-1){
                if(parity==0) First+=1-m;
                else Second+=1-m;
                i++;
            }
            else{
                if(a[i+1]==1){
                    First+=1-m;
                    Second+=1-m;
                    i+=2;
                }
                else{
                    if(parity==0){
                        First+=1-m;
                        parity = 1;
                    }
                    else{
                        Second+=1-m;
                        parity = 0;
                    }
                    i++;
                }
            }
        }
        else{
            if(i==n-1){
                if(parity==0){
                    First+=a[n-1]-1;
                    Second+=1-m;
                }
                else{
                    Second+=a[n-1]-1;
                    First+=1-m;
                }
                i++;
            }
            else{
                if(a[i+1]==1){
                    if(parity==0){
                        First+=a[i]-m;
                        Second+=1-m;
                    }
                    else{
                        Second+=a[i]-m;
                        First+=1-m;
                    }
                    i+=2;
                }
                else{
                    if(parity==0){
                        First+=a[i]-1;
                        Second+=1-m;
                    }
                    else{
                        Second+=a[i]-1;
                        First+=1-m;
                    }
                    i++;
                }
            }
        }
    }
    if(First-Second>0)cout<<"First"<<endl;
    else cout<<"Second"<<endl;
}