#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const long long INF = (1e18);
const long long infinity = (1e9);
const long double PI = 4 * atan((long double)1);
void array_debug(vector<long long> ar) {
  for (long long i = 0; i < ar.size(); i++) cout << ar[i];
  cout << '\n';
}
long long power(long long x, long long n, long long MOD) {
  long long result = 1;
  while (n > 0) {
    if (n & 1) result = (result * x) % MOD;
    x = (x * x) % MOD;
    n >>= 1;
  }
  return result % MOD;
}
long long gcd(long long a, long long b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.precision(20);
  long long n, k;
  cin >> n >> k;
  vector<long long> ar(n);
  unordered_map<long long, bool> dp;
  dp[0] = 0;
  for (auto &x : ar) cin >> x;
  for (long long i = 1; i <= k; i++) {
    if (i < ar[0]) {
      dp[i] = 0;
      continue;
    }
    for (auto &x : ar) {
      if (!dp[i - x]) dp[i] = 1;
    }
  }
  cout << (dp[k] ? "First" : "Second");
}
