#include <bits/stdc++.h>
using namespace std;
template <typename T>
void show(const T& v) {
  cerr << v << ' ';
}
template <typename T1, typename... T2>
void show(const T1& first, const T2&... rest) {
  show(first);
  show(rest...);
}
template <typename F, typename S>
ostream& operator<<(ostream& os, const pair<F, S>& p) {
  return os << "(" << p.first << ", " << p.second << ")";
}
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
  os << "{";
  typename vector<T>::const_iterator it;
  for (it = v.begin(); it != v.end(); it++) {
    if (it != v.begin()) os << ", ";
    os << *it;
  }
  return os << "}";
}
template <typename T>
ostream& operator<<(ostream& os, const set<T>& v) {
  os << "[";
  typename set<T>::const_iterator it;
  for (it = v.begin(); it != v.end(); it++) {
    if (it != v.begin()) os << ", ";
    os << *it;
  }
  return os << "]";
}
template <typename F, typename S>
ostream& operator<<(ostream& os, const map<F, S>& v) {
  os << "[";
  typename map<F, S>::const_iterator it;
  for (it = v.begin(); it != v.end(); it++) {
    if (it != v.begin()) os << ", ";
    os << it->first << " = " << it->second;
  }
  return os << "]";
}
const double eps = 1e-9;
int solve() {
  int n, k;
  scanf("%d %d", &n, &k);
  int arr[n];
  for (int i = 0; i < n; i++) scanf("%d", &arr[i]);
  bool dp[k + 1];
  memset(dp, 0, sizeof dp);
  for (int i = 1; i <= k; i++) {
    for (int j = 0; j < n; j++) {
      if (i - arr[j] < 0) continue;
      dp[i] = (!dp[i - arr[j]]);
    }
  }
  if (dp[k])
    printf("First\n");
  else
    printf("Second\n");
  return 0;
}
int main() {
  int t = 1, cs = 0;
  while (t--) {
    solve();
  }
  return 0;
}
