#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
const ll INFll = 1ll * 1000000009 * 1000000009;
const long double PI =
    3.141592653589793238462643383279502884197169399375105820974944;
ll gcd(ll a, ll b) { return (b == 0) ? a : gcd(b, a % b); }
ll bpow(ll a, ll b, ll m) {
  a %= m;
  ll res = 1;
  while (b > 0) {
    if (b & 1) res = res * a % m;
    a = a * a % m;
    b >>= 1;
  }
  return res;
}
void solve() {
  ll n, m;
  cin >> n >> m;
  vector<ll> v(n);
  for (ll i = 0; i < n; i++) {
    cin >> v[i];
  }
  vector<vector<bool> > dp(n);
  for (ll i = 0; i < n; i++) {
    dp[i].resize(m + 1);
    for (ll j = 0; j < m + 1; j++) {
      if (i == 0) {
        if (j < v[i])
          dp[i][j] = 0;
        else
          dp[i][j] = !dp[i][j - v[i]];
      } else {
        if (j < v[i])
          dp[i][j] = dp[i - 1][j];
        else {
          dp[i][j] = !dp[i][j - v[i]];
          dp[i][j] = max(dp[i][j], dp[i - 1][j]);
        }
      }
    }
  }
  if (dp[n - 1][m] == 0) {
    cout << "Second" << endl;
  } else {
    cout << "First" << endl;
  }
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ll t = 1;
  for (ll i = 0; i < t; i++) {
    solve();
  }
  return 0;
}
