#include <bits/stdc++.h>
using namespace std;
vector<long long> v;
bool dp[100009];
long long x, y, z, a, b, c, sum, ans, total, t, cnt, n, m, k, p, kase;
bool findAns() {
  for (long long stone = 0; stone <= k; stone++)
    for (long long &i : v) {
      if (i <= stone && !dp[stone - i]) dp[stone - i] = true;
    }
  return dp[k];
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  cin >> n >> k;
  v.resize(n);
  for (long long i = 0; i < n; i++) {
    cin >> v[i];
  }
  memset(dp, false, sizeof(dp));
  if (findAns())
    cout << "First" << endl;
  else
    cout << "Second" << endl;
  return 0;
}
