#include <bits/stdc++.h>
using namespace std;
static const int MAX_N = 100;
static const int MAX_K = 100000;
int N, K;
int a[MAX_N];
bool memo[MAX_K + 1];
int main() {
  scanf("%d %d", &N, &K);
  for (int i = 0; i < N; i++) scanf("%d", &a[i]);
  sort(a, a + N);
  fill(memo, memo + K + 1, false);
  for (int i = 0; i <= K; i++) {
    if (i < a[0])
      memo[i] = false;
    else if (i >= a[0] && i <= a[N - 1])
      memo[i] = true;
    else {
      for (int j = 0; j < N; j++) memo[i] |= !memo[i - a[j]];
    }
  }
  if (memo[K])
    printf("First\n");
  else
    printf("Second\n");
  return 0;
}
