#include <bits/stdc++.h>
using namespace std;
long long dp[3001];
long long flag = 0;
bool winner(long long ar[], long long n, long long k) {
  if (k == 0) {
    return 0;
  }
  if (dp[k] != -1) {
    return dp[k];
  }
  for (long long i = 0; i < n; i++) {
    if (winner(ar, n, k - ar[i]) == 0) {
      return dp[k] = 1;
    } else {
      return dp[k] = 0;
    }
  }
}
signed main() {
  long long n, k;
  cin >> n >> k;
  long long ar[n];
  for (long long i = 0; i < n; i++) {
    cin >> ar[i];
  }
  memset(dp, -1, sizeof dp);
  if (winner(ar, n, k)) {
    cout << "First\n";
  } else {
    cout << "Second\n";
  }
  return 0;
}
