#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 500;
const long long mod = 1e9 + 7;
const long long cmod = 998244353;
const long long inf = 1LL << 61;
const int M = 1e6 + 500;
const long long int ths = 1LL << 40;
const int NN = 5e3 + 6;
long long int n, k;
long long int a[107];
long long int cache[N];
long long int dp(long long int k) {
  if (k < a[1]) {
    return 0;
  }
  long long int &ans = cache[k];
  if (ans != -1) return ans;
  ans = 0;
  for (int i = 1; i <= n; i++) {
    ans |= (dp(k - a[i]) == 0);
  }
  return ans;
}
void solve() {
  cin >> n >> k;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
  }
  memset(cache, -1, sizeof cache);
  long long int ans = dp(k);
  if (ans == 1)
    cout << "First";
  else
    cout << "Second";
  cout << '\n';
  return;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
