#include <bits/stdc++.h>
using namespace std;
const long long N = 1e5 + 5;
long long check[N];
long long a[105];
long long n, k;
long long res(long long q) {
  if (check[q] != -1) return check[q];
  check[q] = 0;
  for (long long i = 1; i <= n; i++) {
    if (q - a[i] < 0) break;
    check[q] |= (res((q - a[i]) == 0));
  }
  return check[q];
}
int32_t main() {
  memset(check, -1, sizeof(check));
  cin >> n >> k;
  for (long long i = 1; i <= n; i++) cin >> a[i];
  if (res(k))
    cout << "First";
  else
    cout << "Second";
}
