#include <bits/stdc++.h>
using namespace std;
int dx[] = {0, 1, 0, -1, 1, 1, -1, -1};
int dy[] = {1, 0, -1, 0, 1, -1, 1, -1};
long long fix_mod(long long x, long long y) { return (y + x % y) % y; }
void fast() {
  std::ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
}
int mem[(int)1e5 + 10][3];
vector<int> v;
int solve(int k, int c) {
  int& ret = mem[k][c];
  if (!ret) return ret;
  for (int i = 0; i < v.size(); i++) {
    if (k >= v[i]) {
      ret = solve(k - v[i], c % 2 + 1);
      if (ret == c) return c;
    }
  }
  return c % 2 + 1;
}
int main() {
  fast();
  memset(mem, -1, sizeof mem);
  int n, k;
  cin >> n >> k;
  v = vector<int>(n);
  for (int i = 0; i < n; i++) cin >> v[i];
  cout << (solve(k, 1) != 2 ? "First" : "Second") << "\n";
}
