#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  constexpr char nl = '\n';
  const int mod = 1e9 + 7;
  int N = 0;
  int K = 0;
  cin >> N >> K;
  vector<int> a(N);
  for (int i = 0; i < N; ++i) {
    cin >> a[i];
  }
  vector<bool> dp(K + 1, true);
  int mx = *max_element(a.begin(), a.end());
  fill(dp.begin(), dp.begin() + mx + 1, false);
  for (int j = 0; j < N; ++j) {
    dp[a[j]] = true;
  }
  for (int i = mx + 1; i <= K; ++i) {
    for (int j = 0; j < N; ++j) {
      if (i > a[j]) {
        dp[i] = dp[i] && dp[i - a[j]];
        if (!dp[i]) {
          break;
        }
      }
    }
    dp[i] = !dp[i];
  }
  cout << (dp[K] ? "First" : "Second") << nl;
  return 0;
}
