#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 3;
const int MOD = 1e9 + 7;
const int N = 1e5 + 3;
int n, k, a[N];
bool f[N];
void input() {
  cin >> n >> k;
  for (int i = (1), _b = (n); i <= (_b); ++i) cin >> a[i];
}
void solve() {
  for (int i = (0), _b = (k); i <= (_b); ++i)
    for (int j = (1), _b = (n); j <= (_b); ++j)
      if (i >= a[j] && !f[i - a[j]]) {
        f[i] = 1;
        break;
      }
  cout << (f[k] ? "First" : "Second") << '\n';
}
int main() {
  input();
  solve();
  return 0;
}
