#include <bits/stdc++.h>
using namespace std;
int dp[100001][2];
int n, k;
int a[101];
bool who_wins(int k_left, bool taro_turn) {
  if (k_left == 0) {
    if (taro_turn)
      return !taro_turn;
    else
      return taro_turn;
  }
  if (k_left < 0) {
    if (taro_turn)
      return taro_turn;
    else
      return !taro_turn;
  }
  if (dp[k_left][taro_turn] != -1) return dp[k_left][taro_turn];
  bool ans;
  if (taro_turn) {
    ans = false;
    for (int i = 0; i < n; i++)
      ans = ans || who_wins(k_left - a[i], !taro_turn);
  } else {
    ans = true;
    for (int i = 0; i < n; i++) {
      ans = ans && who_wins(k_left - a[i], !taro_turn);
    }
  }
  return dp[k_left][taro_turn] = ans;
}
int main() {
  memset(dp, -1, sizeof(dp));
  cin >> n >> k;
  for (int i = 0; i < n; i++) cin >> a[i];
  if (who_wins(k, true))
    cout << "First";
  else
    cout << "Second";
  return 0;
}
