//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
template<class T> using PQ = priority_queue<T>;
template<class T> using PQG = priority_queue<T, vector<T>, greater<T> >;
const int INF = 0xccccccc;
const ll LINF = 922337203685477580LL;
template<typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {return a < b && (a = b, true);}
template<typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {return a > b && (a = b, true);}
template<typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) { return is >> p.first >> p.second;}
template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) { return os << p.first << ' ' << p.second;}

#define N 200100

//head

int n;
ll m;
ll a[N];
ll dp[N][2][2];

ll dfs(int i=0, int nokori=1, int f=1) {
  if(dp[i][nokori][f] != -1) return dp[i][nokori][f];
  ll &res = dp[i][nokori][f];
  if(i == n) return res = 0;
  if(!nokori) {
    return res = dfs(i+1, 1, f^1) + (f?1-m:0);
  }
  if(f) {
    if(a[i] != 1) res = max(dfs(i, 0, f^1)+a[i]-1, dfs(i+1, 1, f^1)+a[i]-m);
    else res = dfs(i+1, 1, f^1) + 1-m;
  }
  else {
    if(a[i] != 1) res = min(dfs(i, 0, f^1), dfs(i+1, 1, f^1));
    else res = dfs(i+1, 1, f^1);
  }
  return res;
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  memset(dp, -1, sizeof(dp));
  cin >> n >> m;
  rep(i, n) cin >> a[i];
  ll x = dfs();
  ll sum = accumulate(a, a+n, 0LL)-m*n;
  if(x > sum-x) cout << "First" << endl;
  else cout << "Second" << endl;
}