#include <bits/stdc++.h>
using namespace std;
const int dx[] = {1, 0, -1, 0, 1, 1, -1, -1};
const int dy[] = {0, 1, 0, -1, 1, -1, 1, -1};
void Open() {}
const int mod = long long(1e9 + 7), N = 2000 + 5;
int n, a[101], k;
int mem[(int)1e5][2];
bool stones(int rem = k, bool state = 0) {
  if (rem == 0) return state;
  int &ret = mem[rem][state];
  if (~ret) return ret;
  ret = state;
  for (int i = 0; i < n; i++) {
    if (rem - a[i] >= 0) {
      if (state)
        ret &= stones(rem - a[i], !state);
      else
        ret |= stones(rem - a[i], !state);
    }
  }
  return ret;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  memset(mem, -1, sizeof mem);
  cin >> n >> k;
  for (int i = 0; i < n; i++) cin >> a[i];
  sort(a, a + n);
  cout << (stones() ? "First\n" : "Second");
}
