#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
const ll INF = 1LL << 55;
signed main() {
  ll N, K;
  cin >> N >> K;
  ll A[N];
  for (ll i = 0; i < N; i++) cin >> A[i];
  sort(A, A + N);
  ll dp[K + 1];
  fill(dp, dp + K + 1, 0);
  for (ll i = 0; i < A[0]; i++) {
    dp[i] = -1;
  }
  for (ll i = A[0]; i <= K; i++) {
    bool lose = true;
    for (ll j = 0; j < N; j++) {
      if (i - A[j] >= 0 && dp[i - A[j]] == -1) {
        dp[i] = 1;
        lose = false;
        break;
      }
    }
    if (lose) A[i] = -1;
  }
  cout << (dp[K] == 1 ? "First" : "Second") << endl;
  return 0;
}
