#include <bits/stdc++.h>
using namespace std;
const int oo = int(1e9);
const int64_t lloo = (int64_t)(1e18);
const int MAXN = int(1e5) + 10;
class Task {
 public:
  int n, k;
  vector<int> A;
  bool dp[MAXN];
  bool vis[MAXN];
  int minimum = oo;
  bool go(int K) {
    if (K < minimum) return false;
    if (vis[K]) {
      return dp[K];
    }
    bool &ans = dp[K];
    ans = false;
    for (int i = 1; i <= n; ++i) {
      if (!go(K - A[i])) {
        ans = true;
      }
      if (ans) break;
    }
    vis[k] = true;
    return ans;
  }
  void solveOne(istream &in, ostream &out) {
    in >> n >> k;
    A.resize(n + 1);
    for (int i = 1; i <= n; ++i) {
      in >> A[i];
      minimum = min(minimum, A[i]);
    }
    memset(dp, false, sizeof(dp));
    memset(vis, false, sizeof(vis));
    bool ans = go(k);
    {
      cout << (ans ? "First" : "Second") << '\n';
      return;
    };
  }
  void solve(istream &in, ostream &out) {
    int t = 1;
    while (t--) solveOne(in, out);
  }
};
auto main() -> int {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  Task solver;
  istream &in(cin);
  ostream &out(cout);
  solver.solve(in, out);
  return 0;
}
