#include <bits/stdc++.h>
using namespace std;
const int MM = 1e9;
const int MOD = 1e9 + 7;
const long double PI = acos(-1);
const long long INF = 1e15;
int dx[8] = {-1, 0, 1, 0, -1, -1, 1, 1};
int dy[8] = {0, -1, 0, 1, -1, 1, 1, -1};
template <typename T>
T GCD(T u, T v) {
  return v ? GCD(v, u % v) : u;
}
template <typename T>
T LCM(T x, T y) {
  T gc = GCD(x, y);
  return x * y / gc;
}
const int COM_MAX = 500500;
long long fac[COM_MAX], finv[COM_MAX], inv[COM_MAX];
void init() {
  fac[0] = fac[1] = 1;
  finv[0] = finv[1] = 1;
  inv[1] = 1;
  for (int i = 2; i < COM_MAX; i++) {
    fac[i] = fac[i - 1] * i % MOD;
    inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
    finv[i] = finv[i - 1] * inv[i] % MOD;
  }
}
long long nCr(int n, int k) {
  if (n < k || n < 0 || k < 0) return 0;
  return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
long long modpow(long long a, long long n, long long MOD) {
  long long res = 1;
  while (n > 0) {
    if (n & 1) res = res * a % MOD;
    a = a * a % MOD;
    n >>= 1;
  }
  return res;
}
long long modinv(long long a, long long Mod) { return modpow(a, Mod - 2, Mod); }
bool IsPrime(int x) {
  for (int i = 2; i * i <= x; i++) {
    if (x % i == 0) {
      return false;
    }
  }
  return true;
}
vector<pair<long long, long long> > PrimeFactor(long long N) {
  vector<pair<long long, long long> > prime;
  for (int i = 2; i * i <= N; i++) {
    if (N % i != 0) continue;
    int cnt = 0;
    while (N % i == 0) {
      cnt++;
      N /= i;
    }
    prime.push_back({i, cnt});
  }
  if (N > 1) {
    prime.push_back({N, 1});
  }
  return prime;
}
vector<pair<long long, long long> > CountPrime(long long N) {
  vector<pair<long long, long long> > prime;
  for (long long i = 2; i * i <= N; i++) {
    if (N % i != 0) continue;
    long long cnt = 0, n = N;
    while (n % i == 0) {
      cnt++;
      n /= i;
    }
    prime.push_back({i, cnt});
  }
  prime.push_back({N, 1});
  return prime;
}
bool dp[100100];
int main() {
  int N, K;
  cin >> N >> K;
  vector<int> a(N);
  for (int i = 0; i < N; i++) {
    cin >> a[i];
  }
  fill(dp, dp + 100010, false);
  for (int i = 0; i < N; i++) {
    for (int j = a[i]; j <= K; j++) {
      dp[j] = (dp[j] || !dp[j - a[i]]);
    }
  }
  if (dp[K])
    cout << "First" << endl;
  else
    cout << "Second" << endl;
}
