#include <bits/stdc++.h>
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
long long a[111111], n, minV;
unordered_map<long long, bool> cache;
void c_p_c() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
}
bool solve(long long s) {
  if (s < 0) {
    return false;
  }
  if (s == 0) {
    return false;
  }
  if (s < minV) {
    return false;
  }
  if (cache.find(s) != cache.end()) {
    return cache[s];
  }
  bool ans = true;
  for (long long i = 0; i < n; i++) {
    ans &= solve(s - a[i]);
  }
  if (ans == false) {
    return cache[s] = true;
  } else {
    return cache[s] = false;
  }
}
int32_t main() {
  long long x;
  cin >> n >> x;
  minV = INT_MAX;
  for (long long i = 0; i < n; i++) {
    cin >> a[i];
    minV = min(minV, a[i]);
  }
  bool res = solve(x);
  if (res == true) {
    cout << "First" << endl;
  } else {
    cout << "Second" << endl;
  }
  return 0;
}
