#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, k;
  cin >> n >> k;
  vector<int> A(n);
  unordered_set<int> setA;
  for (int i = 0; i < n; i++) {
    cin >> A[i];
    setA.insert(A[i]);
  }
  sort(A.begin(), A.end());
  vector<int> dp(k + 1);
  for (int i = 0; i <= k; i++) {
    if (i < A[0]) {
      dp[i] = i;
      continue;
    }
    dp[i] = A[0];
    for (int j = 0; j < n; j++) {
      if (i >= A[j] && setA.find(i - A[j]) == setA.end()) {
        dp[i] = i - A[j];
        break;
      }
    }
  }
  bool taroTurn = true;
  bool taroWins = true;
  while (k >= 0) {
    if (dp[k] == k) {
      if (taroTurn) {
        taroWins = false;
      }
      break;
    }
    taroTurn = !taroTurn;
    k = dp[k];
  }
  if (taroWins) {
    cout << "First" << '\n';
  } else {
    cout << "Second" << '\n';
  }
  return 0;
}
