#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 1;
int n, k, a[104], dp[N][2];
int calc(int val, bool p) {
  if (val == 0) return !p;
  int &ret = dp[val][p];
  if (ret != -1) return ret;
  if (p == 0)
    ret = 1e9;
  else
    ret = 0;
  for (int i = 0; i < n; i++) {
    if (val - a[i] < 0) continue;
    if (p == 0)
      ret = min(ret, calc(val - a[i], !p));
    else
      ret = max(ret, calc(val - a[i], !p));
  }
  return ret;
}
int main() {
  cin >> n >> k;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  memset(dp, -1, sizeof dp);
  if (calc(k, 0) == 1)
    cout << "Second";
  else
    cout << "First";
  return 0;
}
