#include <bits/stdc++.h>
using namespace std;
template <class Q>
void clearQueue(Q& q) {
  q = Q();
}
void solve() {
  long long dp[100005];
  long long n, k;
  cin >> n >> k;
  vector<long long> a(n);
  for (long long& x : a) {
    cin >> x;
  }
  dp[0] = 0;
  for (long long i = 1; i <= k; i++) {
    for (long long j = 0; j < n; j++) {
      if (i - a[j] >= 0 && dp[i - a[j]] == 0) dp[i] = 1;
    }
  }
  if (dp[k] == 1)
    cout << "First";
  else
    cout << "Second";
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long T = 1;
  while (T--) {
    solve();
  }
  return 0;
}
