#include <bits/stdc++.h>
using namespace std;
const long long N = 100010;
long long dp[100010][2];
long long n, k;
double pi;
vector<long long> arr;
bool solve(long long s, long long t) {
  bool lose = true;
  for (long long i = 0; i < n; i++) {
    if (s >= arr[i]) lose = false;
  }
  if (lose) {
    if (t == 0) {
      dp[s][t] = 0;
      return false;
    } else {
      dp[s][t] = 1;
      return true;
    }
  }
  bool who;
  for (long long i = 0; i < n; i++) {
    if (s >= arr[i]) {
      long long nn = t ^ 1;
      who = solve(s - arr[i], nn);
      if (t == 0 && who == true) {
        dp[s][t] = 1;
        return true;
      }
      if (t == 1 && who == false) {
        dp[s][t] = 0;
        return false;
      }
    }
  }
  if (t == 0) {
    dp[s][t] = 0;
    return false;
  } else {
    dp[s][t] = 1;
    return true;
  }
}
void mymain() {
  cin >> n >> k;
  arr.resize(n);
  for (long long i = 0; i < n; i++) cin >> arr[i];
  bool ans = solve(k, 0);
  for (long long i = 0; i < N; i++) {
    for (long long j = 0; j < 2; j++) {
      dp[i][j] = -1;
    }
  }
  if (ans)
    cout << "First" << '\n';
  else
    cout << "Second" << '\n';
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ;
  long long t = 1;
  for (long long tt = 0; tt < t; tt++) {
    mymain();
  }
  return 0;
}
