#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
const ll mod = 1000000007;
const ll INF = 1000000099;
vector<ll> dx = {-1, 1, 0, 0}, dy = {0, 0, -1, 1};
int dp[100010] = {};
signed main() {
  int n;
  cin >> n;
  ll k;
  cin >> k;
  vector<ll> a(n);
  for (ll i = 0; i < (ll)(n); i++) cin >> a[i];
  for (ll i = 0; i < (ll)(k + 1); i++) {
    for (ll j = 0; j < (ll)(n); j++) {
      dp[i + a[j]] = max(1 - dp[i], dp[i + a[j]]);
    }
  }
  if (dp[k] == 1) {
    cout << "First" << endl;
  } else {
    cout << "Second" << endl;
  }
}
