#include <bits/stdc++.h>
using namespace std;
int N, K;
int A[100];
int dp[100000], B[100000];
int f(int k) {
  if (B[k]) return dp[k];
  B[k] = 1;
  int &r = dp[k];
  if (k < A[0]) return r = 0;
  for (int i = 0; i < N && A[i] <= k; i++)
    if (f(k - A[i]) == 0) return r = 1;
  return r = 0;
}
int main(int argc, char **argv) {
  scanf("%d %d", &N, &K);
  for (int i = 0; i < N; i++) scanf("%d", &A[i]);
  sort(A, A + N);
  dp[0] = 1;
  if (f(K))
    printf("First\n");
  else
    printf("Second\n");
  return 0;
}
