#include <bits/stdc++.h>
using namespace std;
template <class c>
struct rge {
  c b, e;
};
template <class c>
rge<c> range(c i, c j) {
  return rge<c>{i, j};
}
template <class c>
auto dud(c* x) -> decltype(cerr << *x, 0);
template <class c>
char dud(...);
struct debug {
  template <class c>
  debug& operator<<(const c&) {
    return *this;
  }
};
using ll = long long;
using ii = pair<int, int>;
using vi = vector<int>;
using vii = vector<ii>;
const int oo = 1e8 + 7;
int main() {
  int n, k;
  scanf("%d%d", &n, &k);
  vector<bool> winIfIs(k + 1, false);
  vi s(n);
  int minStone = oo;
  for (int i = 0; i < n; ++i) {
    scanf("%d", &s[i]);
    minStone = min(minStone, s[i]);
  }
  for (int i = minStone; i <= k; ++i) {
    for (int j = 0; j < n; ++j) {
      if (winIfIs[i - s[j]] == false) {
        winIfIs[i] = true;
        break;
      }
    }
  }
  if (winIfIs[k] == true) {
    cout << "First" << endl;
  } else {
    cout << "Second" << endl;
  }
  return 0;
}
