#include <bits/stdc++.h>
const long long N = 500005;
const long long mod = 1e9 + 7;
using namespace std;
void solve() {
  long long n, k;
  cin >> n >> k;
  std::vector<long long> a(n);
  for (int i = 0; i < n; ++i) {
    cin >> a[i];
  }
  std::vector<bool> dp(k + 1);
  for (long long stones = 0; stones <= k; ++stones) {
    for (auto it : a) {
      if (stones >= it and !dp[stones - it]) {
        dp[stones] = 1;
      }
    }
  }
  if (dp[k])
    cout << "First\n";
  else
    cout << "Second\n";
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long T = 1;
  while (T--) {
    solve();
  }
  return 0;
}
