#include <bits/stdc++.h>
using namespace std;
long long power(long long x, long long y) {
  long long r = 1, z = x;
  while (y) {
    if (y & 1) r *= z;
    z *= z;
    y = y >> 1;
  }
  return r;
}
long long powerm(long long x, long long y, long long p) {
  long long r = 1;
  while (y) {
    if (y & 1) r = (r * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return r % p;
}
long long modinv(long long x, long long m) { return powerm(x, m - 2, m); }
long long logarithm(long long a, long long b) {
  long long x = 0;
  while (a > 1) {
    x++;
    a /= b;
  }
  return x;
}
long long dp[10000005];
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long n, k;
  cin >> n >> k;
  memset(dp, -1, sizeof(dp));
  dp[0] = 0;
  vector<long long> p(n);
  long long mini = INT_MAX;
  for (long long i = 0; i < n; i++) {
    cin >> p[i];
    mini = min(mini, p[i]);
  }
  for (long long i = 0; i <= k; i++) {
    if (dp[i] == -1) continue;
    for (long long j = 0; j < n; j++)
      if (i + p[j] <= k || !dp[i + p[j]]) dp[i + p[j]] = dp[i] ^ 1;
  }
  for (long long i = k - mini + 1; i <= k; i++) {
    if (dp[i]) {
      cout << "First";
      return 0;
    }
  }
  cout << "Second";
  return 0;
}
