#include <bits/stdc++.h>
using namespace std;
int const N = 3001;
long long min(long long x, long long y) {
  if (x < y)
    return x;
  else
    return y;
}
long long max(long long x, long long y) {
  if (x > y)
    return x;
  else
    return y;
}
long long cache[N];
long long n, k, a[N];
long long sol(long long k) {
  if (k == 0) return 0;
  if (cache[k] != -1) return cache[k];
  cache[k] = 0;
  for (int i = 0; i < n; i++) {
    if (k < a[i]) break;
    cache[k] |= (sol(k - a[i]) == 0);
  }
  return cache[k];
}
int main() {
  long long i, j;
  cin >> n >> k;
  memset(cache, -1, sizeof(cache));
  for (i = 0; i < n; i++) cin >> a[i];
  if (sol(k))
    cout << "First" << endl;
  else
    cout << "Second" << endl;
}
