#include <bits/stdc++.h>
using namespace std;
template <class T>
void chmax(T &a, T b) {
  if (a < b) a = b;
}
template <class T>
void chmin(T &a, T b) {
  if (a > b) a = b;
}
constexpr long long INF = 1000000000000000000;
constexpr long long mod = 1000000007;
long long dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};
long long kaijo[2000010];
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
bool prime(long long a) {
  if (a == 1) return false;
  for (long long i = 2; i * i <= a; i++) {
    if (a % i == 0) return false;
  }
  return true;
}
void init_fact() {
  kaijo[0] = 1;
  for (long long i = 1; i <= 2000000; i++) {
    kaijo[i] = kaijo[i - 1] * i;
    kaijo[i] %= mod;
  }
}
long long modpow(long long a, long long b) {
  if (b == 0) return 1;
  if (b % 2) return modpow(a, b - 1) * a % mod;
  long long memo = modpow(a, b / 2);
  return memo * memo % mod;
}
long long comb(long long a, long long b) {
  if (!kaijo[0]) init_fact();
  return kaijo[a] * modpow(kaijo[a - b], mod - 2) % mod *
         modpow(kaijo[b], mod - 2) % mod;
}
long long inv(long long x) {
  x = modpow(x, mod - 2);
  return x;
}
bool kosa(double ax, double ay, double bx, double by, double cx, double cy,
          double dx, double dy) {
  double ta = (cx - dx) * (ay - cy) + (cy - dy) * (cx - ax);
  double tb = (cx - dx) * (by - cy) + (cy - dy) * (cx - bx);
  double tc = (ax - bx) * (cy - ay) + (ay - by) * (ax - cx);
  double td = (ax - bx) * (dy - ay) + (ay - by) * (ax - dx);
  return tc * td < 0 && ta * tb < 0;
}
long long n, k, a[110];
long long b[10001];
long long f(long long x) {
  if (b[x] == 0 || b[x] == 1) return b[x];
  bool flag = false;
  for (long long i = 0; i < n; i++) {
    if (x - a[i] >= 0) {
      if (f(x - a[i]) == false) flag = true;
    }
  }
  if (flag)
    b[x] = 1;
  else
    b[x] = 0;
  return flag;
}
signed main() {
  cin >> n >> k;
  for (long long i = 0; i < n; i++) cin >> a[i];
  fill(b, b + 10001, 2);
  b[0] = 0;
  if (f(k))
    puts("First");
  else
    puts("Second");
  return 0;
}
