#include <bits/stdc++.h>
using namespace std;

long long n, m;
vector<vector<long long>> dp;
vector<long long> a;

int main() {
  cin >> n >> m;
  a.resize(n);
  for (auto &p : a) cin >> p;
  reverse(a.begin(), a.end());
  dp.assign(n, vector<long long>(2, 0));
  dp[0][0] = a[0] - 2 + m;
  dp[0][1] = a[0] - m;
  for (int i = 1; i < n; ++i) {
    long long manum = dp[i - 1][1], minum = dp[i - 1][1];
    if (a[i - 1] != 1) {
      manum = max(manum, dp[i - 1][0]);
      minum = min(minum, dp[i - 1][0]);
    }
    // 0
    dp[i][0] = manum + a[i] - 2 + m;
    // 1
    dp[i][1] = -manum + a[i] - m;
  }
  if ((dp[n - 1][0] > 0 && a[n - 1] != 1) || dp[n - 1][1] > 0)
    cout << "First" << endl;
  else
    cout << "Second" << endl;
  return 0;
}