#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
using namespace std;
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  long long n, k;
  cin >> n >> k;
  vector<long long> v(n);
  bitset<1000010> s;
  long long m = 0;
  for (long long i = 0; i < n; i++) {
    cin >> v[i];
    s[v[i]] = true;
    m = max(m, v[i]);
  }
  for (long long i = 1; i <= 100000; i++) {
    if (s[i]) continue;
    s[i] = true;
    for (long long x : v)
      if (i - x >= 0) s[i] = s[i] & s[i - x];
  }
  cout << (s[k] ? "Second" : "First") << endl;
}
