#include <bits/stdc++.h>
using namespace std;
vector<long long> v(105);
long long n;
vector<long long> dabba(100005, -1);
long long mexNumber(unordered_set<long long>& s) {
  long long mex = 0;
  while (s.find(mex) != s.end()) mex++;
  return mex;
}
long long grundyNumber(long long k) {
  if (k <= 0) return 0;
  if (dabba[k] != -1) return dabba[k];
  unordered_set<long long> s;
  for (long long i = 0; i < n; i++) {
    s.insert(grundyNumber(k - v[i]));
  }
  return dabba[k] = mexNumber(s);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long k;
  cin >> n >> k;
  for (long long i = 0; i < n; i++) cin >> v[i];
  long long ans = grundyNumber(k);
  if (ans != 0)
    cout << "First";
  else
    cout << "Second";
  return 0;
}
