#include <bits/stdc++.h>
using namespace std;
const long long N = 300, K = 123456;
long long dp[K], a[N];
long long n;
bool solve(long long k) {
  if (k == 0) {
    return 0;
  }
  if (dp[k] != -1) {
    return dp[k];
  }
  for (long long i = 0; i < n; i++) {
    if (k >= a[i]) {
      if (solve(k - a[i]) == 0) {
        return 1;
      }
    }
  }
  return 0;
}
signed main() {
  ios::sync_with_stdio(false);
  long long k;
  cin >> n >> k;
  for (long long i = 0; i < n; i++) {
    cin >> a[i];
  }
  fill(dp, dp + K, -1);
  cout << (solve(k) ? "First\n" : "Second\n");
}
