#include <bits/stdc++.h>
using namespace std;
long long n, kk;
long long a[105];
long long dp[100005][2];
long long solve(long long k, bool curr) {
  if (a[1] > k) return false;
  long long &ans = dp[k][curr];
  if (ans != -1) return ans;
  ans = 0;
  for (long long int i = 1; i <= n; i++) {
    bool flag = solve(k - a[i], 1 ^ curr);
    if (!flag) ans = 1;
  }
  return ans;
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  cin >> n >> kk;
  for (long long int i = 1; i <= n; i++) cin >> a[i];
  memset(dp, -1, sizeof(dp));
  bool ans = solve(kk, 0);
  if (ans == 1)
    cout << "First\n";
  else
    cout << "Second\n";
}
