#include <bits/stdc++.h>
using namespace std;
void my_dbg() { cout << endl; }
template <typename Arg, typename... Args>
void my_dbg(Arg A, Args... B) {
  cout << ' ' << A;
  my_dbg(B...);
}
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
const int inf = INT_MAX;
const int ninf = INT_MIN;
const int mod = 1e9 + 7;
const int N = 2e5 + 2;
void solve() {
  int n, k;
  scanf("%d", &n);
  scanf("%d", &k);
  vi a(n);
  for (auto& i : a) scanf("%d", &i);
  vector<bool> dp(k + 1, 0);
  for (int stones = 0; stones <= k; stones++) {
    for (auto x : a) {
      if (stones >= x and ~dp[stones - x]) dp[stones] = 1;
    }
  }
  puts(dp[k] ? "First" : "Second");
}
int main() {
  int t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
