#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, k;
  cin >> n >> k;
  vector<int> a(n);
  for (auto& v : a) {
    cin >> v;
  }
  sort(a.begin(), a.end());
  int a_max = a[n - 1];
  int a_min = a[0];
  bool a_dominate = false;
  int val = a_min - 1;
  while (val < k) {
    if (a_dominate) {
      val += a_min;
    } else {
      val += a_max;
    }
    a_dominate = !a_dominate;
  }
  if (a_dominate) {
    cout << "First\n";
  } else {
    cout << "Second\n";
  }
  return 0;
}
