#include <bits/stdc++.h>
using namespace std;
const double pi = 3.141592653589793;
const long long INF = 1e18;
template <class T>
inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
vector<bool> dp;
vector<int> a;
int n, k;
bool solve(int x) {
  if (dp[x] == 1) return dp[x];
  int res = 0;
  for (long long i = (1); i < (long long)(n); i++) {
    if (x - a[i] >= 0 && solve(x - a[i]) == 0) res = 1;
  }
  return res;
}
int main() {
  cin >> n >> k;
  a.resize(n + 1);
  for (long long i = 0; i < (long long)(n); i++) cin >> a[i + 1];
  dp.resize(k + 1);
  solve(k);
  if (dp[k] == 0)
    cout << "Second" << endl;
  else
    cout << "First" << endl;
}
