#include <bits/stdc++.h>
using namespace std;
int dp[100010];
int A[100010];
int N;
long long int q(int k, int p, int min) {
  int i;
  if (dp[k] != -1)
    return dp[k];
  else if (p == 1 && k < min)
    dp[k] = 1;
  else if (p == -1 && k < min)
    dp[k] = 0;
  else {
    for (i = 0; i < N; i++) dp[k] = q(k - A[i], -1 * p, min);
  }
  return dp[k];
}
int main() {
  int i, K, min, game;
  cin >> N >> K;
  min = 1000010;
  for (i = 0; i < N; i++) {
    cin >> A[i];
    if (A[i] < min) min = A[i];
  }
  for (i = 0; i <= K; i++) {
    dp[i] = -1;
  }
  game = q(K, 1, min);
  if (game == 0)
    cout << "First" << endl;
  else
    cout << "Second" << endl;
}
