#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
void solve() {
  ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
  long long n, k;
  cin >> n >> k;
  long long ar[n];
  for (long long i = 0; i < n; i++) cin >> ar[i];
  bool dp[k + 1];
  dp[0] = false;
  for (long long i = 0; i <= k; i++) {
    for (long long j = 0; j < n; j++) {
      if (i - ar[j] >= 0 && !dp[i - ar[j]]) {
        dp[i] = true;
      }
    }
  }
  if (dp[k])
    cout << "First" << endl;
  else
    cout << "Second" << endl;
}
int32_t main() {
  ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
  long long t = 1;
  for (long long i = 1; i <= t; i++) {
    solve();
  }
  return 0;
}
