#include <bits/stdc++.h>
#pragma GCC optimize "O2"
using namespace std;
const unsigned long long int MOD = 1000000007;
const long double PI = 2 * acos(0.0);
vector<long long int> ga(long long int n) {
  vector<long long int> a;
  for (long long int i = 0; i < n; i++) {
    long long int p;
    cin >> p;
    a.push_back(p);
  }
  return move(a);
}
vector<unsigned long long int> gau(unsigned long long int n) {
  vector<unsigned long long int> a;
  for (unsigned long long int i = 0; i < n; i++) {
    unsigned long long int p;
    cin >> p;
    a.push_back(p);
  }
  return move(a);
}
vector<string> gas(unsigned long long int n) {
  vector<string> a;
  for (unsigned long long int i = 0; i < n; i++) {
    string p;
    cin >> p;
    a.push_back(p);
  }
  return move(a);
}
template <typename T, typename A>
void pa(vector<T, A> const &a) {
  for (T p : a) {
    cout << p << " ";
  }
  cout << "\n";
}
void yes() { cout << "YES\n"; }
void no() { cout << "NO\n"; }
void yesno(int f) {
  if (f)
    yes();
  else
    no();
}
void solve() {
  unsigned long long int n, k;
  cin >> n >> k;
  vector<unsigned long long int> a = gau(n);
  vector<unsigned long long int> winner(k + 1, 0);
  for (unsigned long long int i = 0; i < n; i++) {
    if (a[i] <= k)
      winner[a[i]] = 1;
    else
      break;
  }
  deque<unsigned long long int> process(a.begin(), a.end());
  while (winner[k] == 0) {
    unsigned long long int p = process[0];
    process.pop_front();
    for (unsigned long long int i = 0; i < n; i++) {
      if (p + a[i] <= k) {
        if (winner[p + a[i]] == 0) winner[p + a[i]] = winner[p] + 1;
        process.push_back(p + a[i]);
      } else
        break;
    }
  }
  cout << ((winner[k] & 1) ? "First" : "Second");
}
int main(void) {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  solve();
  return 0;
}
