#include <bits/stdc++.h>
using namespace std;
const long long mod = 998244353;
const long long MOD = 1000000007;
map<long long, long long> mp;
int solve() {
  int n, k;
  cin >> n >> k;
  vector<long long> a(n + 1);
  for (long long i = 0; i < n; i++) cin >> a[i + 1];
  sort((a).begin(), (a).end());
  vector<long long> dp(n + 1, 0);
  for (long long i = 1; i < k + 1; i++) {
    for (long long j = 1; j < n + 1; j++) {
      bool win = false;
      if (i >= a[j]) win = 1 - dp[i - a[j]];
      if (win) dp[i] = 1;
    }
  }
  if (dp[k])
    cout << "First" << endl;
  else
    cout << "Second" << endl;
  return 0;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  solve();
  return 0;
}
