#include <bits/stdc++.h>
using namespace std;
const long long N = 1e5 + 2;
long long n, k;
vector<long long> a;
long long dp[N][2];
long long solve(long long x, long long k) {
  if (k < a[0]) return 1 - x;
  if (dp[k][x] != -1) return dp[k][x];
  long long ans = 1 - x;
  for (long long i = 0; i < n; i++) {
    if (a[i] <= k) {
      if (solve(1 - x, k - a[i]) == x) {
        ans = x;
        break;
      }
    } else
      break;
  }
  return dp[k][x] = ans;
}
int32_t main() {
  cin >> n >> k;
  a.resize(n);
  for (long long i = 0; i < N; i++)
    for (long long j = 0; j < 2; j++) dp[i][j] = -1;
  for (long long i = 0; i < n; ++i) {
    cin >> a[i];
  }
  if (solve(0, k) == 0)
    cout << "First\n";
  else
    cout << "Second";
}
