#include <bits/stdc++.h>
using namespace std;
long long a[1000000], dp[2][1000000];
long long solve(long long n, long long k, long long turn) {
  if (k == 0) {
    dp[turn][k] = turn ^ 1;
    return dp[turn][k];
  }
  dp[turn][k] = turn ^ 1;
  for (long long i = 0; i < n && a[i] <= k; i++) {
    if (turn == solve(n, k - a[i], turn ^ 1)) {
      dp[turn][k] = turn;
    }
  }
  return dp[turn][k];
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  long long n, k;
  cin >> n >> k;
  for (long long i = 0; i < n; i++) cin >> a[i];
  string ans[] = {"First", "Second"};
  sort(a, a + n);
  cout << ans[solve(n, k, 0)] << "\n";
  ;
  return 0;
}
