#include <bits/stdc++.h>
using namespace std;
void solve() {
  int N, K;
  cin >> N >> K;
  vector<int> vec(N);
  for (int i = 0; i < N; i++) cin >> vec[i];
  sort(vec.begin(), vec.end());
  vector<vector<bool> > dp(K + 1, vector<bool>(N, false));
  for (int i = 0; i <= K; i++) {
    int l = i / vec[0];
    if (l % 2 == 0)
      dp[i][0] = false;
    else
      dp[i][0] = true;
  }
  for (int i = 1; i <= K; i++) {
    for (int j = 1; j < N; j++) {
      if (vec[j] > i) {
        dp[i][j] = dp[i][j - 1];
      } else {
        if (dp[i][j - 1] == true) {
          dp[i][j] = true;
        } else
          dp[i][j] = !dp[i - vec[j]][j - 1];
      }
    }
  }
  if (dp[K][N - 1]) {
    cout << "First" << endl;
  } else
    cout << "Second" << endl;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int T;
  T = 1;
  while (T--) {
    solve();
  }
  return 0;
}
