#include <bits/stdc++.h>
using namespace std;
int N, K, len;
vector<int> a;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> N >> K;
  a.resize(N);
  for (int i = 0; i < N; i++) {
    cin >> a[i];
  }
  sort(a.begin(), a.end());
  len = a.size();
  if (K >= a[0] && K < (a[0] + a[len - 1])) {
    cout << "First" << endl;
  } else {
    int num = K - (a[0] + a[len - 1]);
    if ((num / a[0]) % 2) {
      cout << "First" << endl;
    } else {
      cout << "Second" << endl;
    }
  }
  return 0;
}
