#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007LL;
long long n, k;
long long x[105];
long long dp[100005];
long long ans(long long k, bool chance) {
  if (k < 0) {
    return -1;
  }
  if (dp[k] != -1) return dp[k];
  for (int i = 0; i < n; i++) {
    if (ans(k - x[i], !chance) == chance) {
      return dp[k] = chance;
    }
  }
  return dp[k] = !chance;
}
void solve() {
  cin >> n >> k;
  for (int i = 0; i < n; i++) {
    cin >> x[i];
  }
  memset(dp, -1, sizeof(dp));
  cout << (ans(k, true) ? "First" : "Second");
}
int main(int argc, char const *argv[]) {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int T = 1;
  while (T--) {
    solve();
  }
  return 0;
}
