#include <bits/stdc++.h>
using namespace std;
int grundy[100000 + 1];
int a[100000];
void init(int min) {
  for (int i = 0; i <= 100000; i++) {
    if (i >= min)
      grundy[i] = -1;
    else
      grundy[i] = 0;
  }
}
int solve(int k, int n) {
  if (k < 0) return 0;
  if (grundy[k] != -1) return grundy[k];
  int s = 1;
  for (int i = 0; i < n; i++) {
    s *= solve(k - a[i], n);
  }
  if (s == 0)
    return grundy[k] = 1;
  else
    return grundy[k] = 0;
}
int main() {
  int n, k;
  cin >> n >> k;
  int m = INT_MAX;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    m = min(a[i], m);
  }
  init(m);
  long long ans = 0;
  if (n == 1) {
    if ((k / a[0]) & 1)
      cout << "First";
    else
      cout << "Second";
    exit(0);
  }
  ans = solve(k, n);
  if (ans)
    cout << "First";
  else
    cout << "Second";
  return 0;
}
