#include <bits/stdc++.h>
using namespace std;
void FIO() {}
long long int modInv(long long int a, long long int b, long long int m) {
  long long int res = 1;
  a = a % m;
  while (b > 0) {
    if (b & 1) {
      res = (res * a) % m;
    }
    a = (a * a) % m;
    b = b >> 1;
  }
  return res;
}
void solve() {
  long long int n, k;
  cin >> n >> k;
  long long int a[n];
  for (long long int i = 0; i < n; i++) cin >> a[i];
  long long int dp[k + 1];
  memset(dp, 0, sizeof(-1));
  for (long long int i = 1; i <= k; i++) {
    for (long long int j = 0; j < n; j++) {
      if (i - a[j] >= 0 and dp[i - a[j]] == 0) {
        dp[i] = 1;
        break;
      }
    }
  }
  if (dp[k] == 1)
    cout << "First";
  else
    cout << "Second";
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  solve();
  return 0;
}
