#include <bits/stdc++.h>
using namespace std;
long long a[1005];
long long n;
long long dp[100005];
long long win(long long k) {
  if (k < a[0]) {
    return 0;
  }
  long long &ans = dp[k];
  if (ans != -1) return 1;
  dp[k] = 0;
  for (long long i = 0; i < n; i++) {
    if (a[i] <= k) {
      if (!win(k - a[i])) {
        return dp[k] = 1;
      }
    }
  }
  return dp[k] = 0;
}
int32_t main() {
  long long k;
  cin >> n >> k;
  for (long long i = 0; i < n; i++) cin >> a[i];
  sort(a, a + n);
  memset(dp, -1, sizeof dp);
  if (win(k)) {
    cout << "First\n";
  } else {
    cout << "Second\n";
  }
  return 0;
}
