#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
using namespace std;
long long max(long long a, long long b) {
  if (a > b)
    return a;
  else
    return b;
}
long long min(long long a, long long b) {
  if (a > b)
    return b;
  else
    return a;
}
const long long mod = 1000 * 1000 * 1000 + 7;
const long long INF = 1e18 + 5;
long long powm(long long a, long long b) {
  long long res = 1;
  while (b) {
    if (b & 1) res = (res * a) % mod;
    a = (a * a) % mod;
    b >>= 1;
  }
  return res;
}
const long long N = 1e5 + 5;
long long n, k;
long long a[N];
long long cache[N];
long long dp(long long stone) {
  if (cache[stone] != -1) return cache[stone];
  for (long long i = (0); i < (n); ++i) {
    if (stone - a[i] < 0) break;
    cache[stone] |= (dp(stone - a[i]) == 0);
  }
  return cache[stone];
}
void solve() {
  cin >> n >> k;
  for (long long i = (0); i < (n); ++i) cin >> a[i];
  memset(cache, -1, sizeof(cache));
  if (dp(k))
    cout << "First";
  else
    cout << "Second";
}
signed main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cout << fixed << setprecision(10);
  long long t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
