#include <bits/stdc++.h>
using namespace std;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int N, K;
  cin >> N >> K;
  vector<int> a(N);
  for (int i = 0; i < N; i++) {
    cin >> a[i];
  }
  vector<bool> dp(K + 1);
  int right = a[0];
  int left = 0;
  bool ins = false;
  while (left != (K + 1)) {
    for (int i = left; i < right; i++) {
      dp[i] = ins;
    }
    left = right;
    ins = not ins;
    right = ins ? min(right + a[N - 1], K + 1) : min(right + a[0], K + 1);
  }
  if (dp[K]) {
    cout << "First" << endl;
  } else {
    cout << "Second";
  }
  return 0;
}
