#include <bits/stdc++.h>
using namespace std;
long long dp[100005], arr[100005], N, K;
long long solve(long long k) {
  if (dp[k] != -1) return dp[k];
  if (k == 0) return dp[k] = 0;
  long long ans = 0;
  for (long long i = 1; i <= N; i++) {
    if (arr[i] > k) continue;
    if (solve(k - arr[i]) == 0) {
      ans = 1;
      break;
    }
  }
  return dp[k] = ans;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> N >> K;
  for (long long i = 0; i < N; i++) {
    cin >> arr[i];
  }
  memset(dp, -1, sizeof(dp));
  if (solve(K))
    cout << "First\n";
  else
    cout << "Second\n";
  return 0;
}
