#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 1;
int n, k, a[100], dp[N];
bool f(int cnt) {
  if (cnt == 0) {
    return 0;
  }
  int &dp = ::dp[cnt];
  if (dp != -1) return dp;
  dp = 0;
  for (int i = 0; i < n; ++i) {
    if (cnt - a[i] >= 0) dp |= !f(cnt - a[i]);
  }
  return dp;
}
int main() {
  memset(dp, -1, sizeof dp);
  cin >> n >> k;
  for (int i = 0; i < n; ++i) cin >> a[i];
  bool yes = f(k);
  cout << (yes ? "First" : "Second");
}
