#include <bits/stdc++.h>
using namespace std;
const int dx[] = {1, -1, 0, 0};
const int dy[] = {0, 0, 1, -1};
constexpr int INF = 100000000;
constexpr long long LINF = 10000000000000000ll;
constexpr int MOD = static_cast<int>(1e9 + 7);
constexpr double EPS = 1e-9;
int N, K;
int a[100];
int m[100001];
void init() {}
int rec(int v, int t) {
  if (m[v] != -1) return m[v];
  int ret = -1;
  if (v <= a[N - 1]) {
    for (long long i = 0ll; i < static_cast<long long>(N); i++) {
      if (v == a[i]) {
        ret = (t == 0 ? 1 : 0);
        break;
      }
    }
    if (ret == -1) ret = (t == 0 ? 0 : 1);
  } else {
    if (t == 0) {
      for (long long i = 0ll; i < static_cast<long long>(N); i++) {
        if (rec(v - a[i], (t + 1) % 2) == 1) {
          ret = 1;
          break;
        }
      }
      if (ret == -1) ret = 0;
    } else {
      for (long long i = 0ll; i < static_cast<long long>(N); i++) {
        if (rec(v - a[i], (t + 1) % 2) == 0) {
          ret = 0;
          break;
        }
      }
      if (ret == -1) ret = 1;
    }
  }
  return m[v] = ret;
}
void solve() {
  for (long long i = 0ll; i < static_cast<long long>(K + 1); i++) m[i] = -1;
  cout << (rec(K, 0) == 1 ? "First" : "Second") << endl;
}
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cin >> N >> K;
  for (long long i = 0ll; i < static_cast<long long>(N); i++) cin >> a[i];
  solve();
  return 0;
}
