#include <bits/stdc++.h>
using namespace std;
template <class T>
inline bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
inline bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
const long long mod = 1e9 + 7;
void chmod(long long &M) {
  if (M >= mod)
    M %= mod;
  else if (M < 0) {
    M += (abs(M) / mod + 1) * mod;
    M %= mod;
  }
}
long long modpow(long long x, long long n) {
  if (n == 0) return 1;
  long long res = modpow(x, n / 2);
  if (n % 2 == 0)
    return res * res % mod;
  else
    return res * res % mod * x % mod;
}
int getl(int i, int N) { return i == 0 ? N - 1 : i - 1; };
int getr(int i, int N) { return i == N - 1 ? 0 : i + 1; };
double argument(const pair<double, double> &a, const pair<double, double> &b) {
  double ax = a.first, ay = a.second, bx = b.first, by = b.second;
  return atan2(by - ay, bx - ax);
}
int n, k;
vector<int> a;
vector<int> memo;
int rec(int x) {
  if (memo[x] != 0) return memo[n];
  if (x == 0) return -1;
  for (int i = 0; i < n; i++) {
    if (x - a[i] >= 0 && rec(x - a[i]) == -1) return memo[x] = 1;
  }
  return memo[x] = -1;
}
void input() {
  cin >> n >> k;
  a.resize(n);
  for (int i = 0; i < n; i++) cin >> a[i];
  memo.resize(k + 5, 0);
}
void solve() {
  if (rec(k) == 1)
    cout << "First" << endl;
  else
    cout << "Second" << endl;
}
int main() {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  input();
  solve();
  return 0;
}
