#include <bits/stdc++.h>
using namespace std;
long long mod = 1000000007;
double pi = 3.1415926536;
long long dp[300000];
long long win(long long a[], long long n, long long k) {
  if (dp[k] != -1) return dp[k];
  if (k <= 0) return 2;
  for (long long i = 0; i < n; i++) {
    long long p = win(a, n, k - a[i]);
    if (p == 2) return 1;
  }
  return dp[k] = 2;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  int tt = 1;
  while (tt--) {
    long long n, x = 0, m = 0, y = 0, d = 1, k = mod;
    cin >> n >> k;
    long long a[n];
    memset(dp, -1, sizeof(dp));
    for (long long i = 0; i < n; i++) {
      cin >> a[i];
      dp[a[i]] = 1;
    }
    x = win(a, n, k);
    if (x == 1)
      cout << "First" << '\n';
    else
      cout << "Second" << '\n';
  }
}
