#include <bits/stdc++.h>
using namespace std;
const long long inf = 1e9 + 7;
const long long mod = 1e9 + 7;
long long n, k;
vector<vector<long long> > dp(100010, vector<long long>(2, inf));
vector<long long> a(110);
long long solve(long long x, long long y) {
  if (dp[x][y] != inf) return dp[x][y];
  if (x < a[0]) return 1 - y;
  long long res;
  if (y == 1)
    res = 0;
  else
    res = 1;
  for (int i = (0); i < (n); i++) {
    if (x < a[i]) continue;
    if (y == 1)
      if (solve(x - a[i], 0) == 1) res = 1;
    if (y == 0)
      if (solve(x - a[i], 1 - y) == 0) res = 0;
  }
  return res;
}
int main() {
  cin >> n >> k;
  for (int i = (0); i < (n); i++) cin >> a[i];
  if (solve(k, 0))
    cout << "Second" << endl;
  else
    cout << "First" << endl;
}
