#include <bits/stdc++.h>
using namespace std;
const int nsz = 1e2, ksz = 1e5;
int n, k, a[nsz + 5], dp[ksz + 5][2];
bool inline dfs(int me, int k) {
  if (dp[k][me] != -1) return dp[k][me];
  if (k < a[1]) return dp[k][me] = 0;
  bool win = &dp[k][me];
  win = 0;
  for (int i = 1; i <= n; ++i) {
    if (k - a[i] >= 0) {
      win |= !dfs(!me, k - a[i]);
    }
  }
  return win;
}
int main() {
  ios::sync_with_stdio(0);
  cin >> n >> k;
  for (int i = 1; i <= n; ++i) {
    cin >> a[i];
  }
  memset(dp, -1, sizeof(dp));
  cout << (dfs(0, k) ? "First" : "Second") << '\n';
}
