#include <bits/stdc++.h>
using namespace std;
const int MAX = 1e2 + 3;
const int mod = 1e9 + 7;
vector<int> v(MAX);
int n;
vector<int> dabba(MAX, -1);
int mexNumber(set<int>& s) {
  int mex = 0;
  while (s.find(mex) != s.end()) mex++;
  return mex;
}
int grundyNumber(int k) {
  if (k == 0) return 0;
  if (dabba[k] != -1) return dabba[k];
  set<int> s;
  for (int 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);
  int t = 1;
  while (t--) {
    int k;
    cin >> n >> k;
    for (int i = 0; i < n; i++) cin >> v[i];
    int ans = grundyNumber(k);
    if (ans != 0)
      cout << "First";
    else
      cout << "Second";
  }
  return 0;
}
