#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
long long lcm(long long a, long long b) { return a * (b / gcd(a, b)); }
long long n, m;
long double a[300];
long long dp[100001][2];
double res;
long long solve(long long j, bool b) {
  if (j <= 0) return b ? -1 : 1;
  long long &r = dp[j][b];
  if (r != -2) return r;
  if (b) {
    r = -10;
    for (long long i = 0; i < n; i++) {
      r = max(r, solve(j - a[i], !b));
    }
  } else {
    r = 10;
    for (long long i = 0; i < n; i++) {
      r = min(r, solve(j - a[i], !b));
    }
  }
  return r;
}
int32_t main(int32_t argc, char const *argv[]) {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  for (long long j = 0; j < 100001; j++) {
    for (long long k = 0; k < 2; k++) {
      dp[j][k] = -2;
    }
  }
  long long k;
  cin >> n >> k;
  for (long long i = 0; i < n; i++) cin >> a[i];
  if (solve(k, false) != 1) {
    cout << "First";
  } else {
    cout << "Second";
  }
  return 0;
}
