#include <bits/stdc++.h>
using namespace std;
long long powmod(long long base, long long exp, long long MOD) {
  long long res = 1;
  while (exp > 0) {
    if (exp % 2 == 1) res = (res * base) % MOD;
    base = (base * base) % MOD;
    exp /= 2;
  }
  return (res % MOD);
}
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
int dp[1000000];
bool cal(vector<int> &a, int n, int k) {
  if (k <= 0) return 0;
  if (dp[k] != -1) return dp[k];
  bool ans = 1;
  for (int i = 0; i < n; ++i) {
    ans &= cal(a, n, k - a[i]);
  }
  return dp[k] = !ans;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int n, k;
  cin >> n >> k;
  vector<int> a(n);
  for (int i = 0; i < n; i++) cin >> a[i];
  memset(dp, -1, sizeof(dp));
  int mn = INT_MAX;
  for (int i = 0; i < n; ++i) mn = min(mn, a[i]);
  for (int i = 0; i < mn; ++i) dp[i] = 0;
  bool ans = cal(a, n, k);
  if (ans)
    cout << "First" << endl;
  else
    cout << "Second" << endl;
}
