#include <bits/stdc++.h>
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target( \
    "sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#pragma GCC optimize("unroll-loops")
using namespace std;
const long long N = 6e5 + 5;
long long powmod(long long base, long long exp, long long mod) {
  long long res = 1LL;
  while (exp > 0) {
    if (exp & 1LL) res = (res * base) % mod;
    exp /= 2LL;
    base = (base * base) % mod;
  }
  return res % mod;
}
long long dp[100001];
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long n, k;
  cin >> n >> k;
  long long a[n];
  for (long long i = 0; i < n; i++) {
    cin >> a[i];
    dp[a[i]] = 1;
  }
  for (long long i = 1; i < a[0]; i++) {
    dp[i] = 2;
  }
  for (long long i = 1; i <= k; i++) {
    long long flag = 0;
    if (dp[i] == 1 || dp[i] == 2) continue;
    for (long long j = 0; j < n; j++) {
      if (a[j] >= i)
        break;
      else {
        if (dp[i - a[j]] == 2) {
          flag = 1;
        }
      }
    }
    if (flag)
      dp[i] = 1;
    else
      dp[i] = 2;
  }
  if (dp[k] == 1)
    cout << "First" << '\n';
  else
    cout << "Second" << '\n';
  return 0;
}
