#include <bits/stdc++.h>
using namespace std;
int dp[100001];
bool canWin(int K, int f, const vector<int> &a) {
  for (auto x : a) {
    if (K - x == 0) {
      dp[K] = f;
      return true;
    }
    if (K - x > 0) {
      if (dp[K] != -1) {
        return dp[K] == f;
      }
      if (canWin(K - x, (f + 1) % 2, a) == false) {
        dp[K] = f;
        return true;
      }
    }
  }
  dp[K] = (f + 1) % 2;
  return false;
}
int main() {
  int N, K;
  cin >> N >> K;
  vector<int> a(N);
  for (auto &x : a) cin >> x;
  for (int i = 0; i <= K; i++) dp[i] = -1;
  for (int i = 1; i < K; i += 1000) {
    canWin(i, 0, a);
  }
  if (canWin(K, 0, a)) {
    cout << "First" << endl;
  } else {
    cout << "Second" << endl;
  }
}
