#include <bits/stdc++.h>
using namespace std;
ifstream in("input.txt");
const long long mod = 1e9 + 7;
long long mod_pow(long long a, long long b) {
  if (b == 0) return 1LL;
  long long res = mod_pow(a, b >> 1);
  res = (res * res) % mod;
  if (b & 1LL) res = (res * a) % mod;
  return res;
}
const int N = 100 + 5;
const int SZ = 1e5 + 5;
int n, k;
int a[N];
int dp[SZ][2];
int solve(int k, int plaiya) {
  if (k < 0) return 1;
  int win = 0;
  for (int i = 0; i < n; i++) {
    win |= !(solve(k - a[i], plaiya ^ 1));
  }
  return win;
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  memset(dp, -1, sizeof dp);
  cin >> n >> k;
  for (int(i) = (0); (i) < (n); (i)++) {
    cin >> a[i];
  }
  int ans = solve(k, 0);
  cout << (ans ? "First" : "Second") << "\n";
  return 0;
}
