#include <bits/stdc++.h>
using namespace std;
int n, k, *x;
char *dp[2];
bool solve(bool turn = 0, int rem = k) {
  if (rem < x[0]) return dp[turn][rem] = !turn;
  char &ret = dp[turn][rem];
  if (~ret) return ret;
  int ans = 0;
  for (int i = 0; rem >= x[i] && i < n; i++)
    if (solve(!turn, rem - x[i]) == turn) {
      ans = i;
      break;
    }
  return ret = solve(!turn, rem - x[ans]);
}
int main() {
  cin.tie(nullptr);
  cout.tie(nullptr);
  ios_base::sync_with_stdio(false);
  cin >> n >> k;
  x = new int[n];
  for (int i = 0; i < 2; i++) {
    dp[i] = new char[k + 1];
    memset(dp[i], -1, k + 1);
  }
  for (int i = 0; i < n; i++) cin >> x[i];
  cout << (solve() ? "Second" : "First");
}
