#include <bits/stdc++.h>
using namespace std;
long long dx[] = {1, 0, -1, 0};
long long dy[] = {0, 1, 0, -1};
long long gcd(long long x, long long y) {
  if (y == 0)
    return x;
  else
    return gcd(y, x % y);
}
long long expo(long long n, long long m, long long p) {
  long long r = 1;
  n = n % p;
  while (m > 0) {
    if (m % 2) r = (r * n) % p;
    n = (n * n) % p;
    m = m / 2;
  }
  return r % p;
}
bool isPrime(long long n) {
  if (n <= 1) return false;
  if (n <= 3) return true;
  if (n % 2 == 0 || n % 3 == 0) return false;
  for (long long i = 5; i * i <= n; i = i + 6)
    if (n % i == 0 || n % (i + 2) == 0) return false;
  return true;
}
vector<long long> z_function(string s) {
  long long n = (long long)s.length();
  vector<long long> z(n);
  for (long long i = 1, l = 0, r = 0; i < n; ++i) {
    if (i <= r) z[i] = min(r - i + 1, z[i - l]);
    while (i + z[i] < n && s[z[i]] == s[i + z[i]]) ++z[i];
    if (i + z[i] - 1 > r) l = i, r = i + z[i] - 1;
  }
  return z;
}
long long n, k;
long long a[105];
bool dp[100005][2], vis[100005][2];
bool solve(long long x, long long p) {
  if (x == 0) {
    if (p == 1) return true;
    return false;
  }
  if (x < 0) {
    if (p == 0) return true;
    return false;
  }
  bool ans = false;
  if (p == 0) {
    for (long long i = 0; i < n; i++) {
      if (x - a[i] >= 0) ans = ans | solve(x - a[i], 1);
    }
  } else {
    ans = true;
    for (long long i = 0; i < n; i++) {
      if (x - a[i] >= 0) ans = ans & solve(x - a[i], 0);
    }
  }
  vis[x][p] = true;
  dp[x][p] = ans;
  return ans;
}
int32_t main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  cin >> n >> k;
  for (long long i = 0; i < n; i++) {
    cin >> a[i];
  }
  bool ans = false;
  for (long long i = 0; i < n; i++) {
    if (k - a[i] >= 0) ans = ans | solve(k - a[i], 1);
  }
  if (ans)
    cout << "First" << '\n';
  else
    cout << "Second" << '\n';
}
