#include <bits/stdc++.h>
using namespace std;
int main(){
  int N;
  long long M;
  cin >> N >> M;
  vector<long long> A(N);
  for (int i = 0; i < N; i++){
    cin >> A[i];
  }
  vector<long long> dp(N);
  dp[N - 1] = A[N - 1] - M;
  if (A[N - 1] > 1){
    dp[N - 1] = max(dp[N - 1], A[N - 1] + M - 2);
  }
  for (int i = N - 2; i >= 0; i--){
    dp[i] = A[i] - M - dp[i + 1];
    if (A[i] > 1){
      dp[i] = max(dp[i], A[i] + M - 1 + dp[i + 1]);
    }
  }
  if (dp[0] > 0){
    cout << "First" << endl;
  } else {
    cout << "Second" << endl;
  }
}