#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int dp[N], a[N];
int n, k;
int play(int l) {
  if (dp[l] != -1) return dp[n];
  if (l == 0) return 0;
  int state = 0;
  for (int i = 1; i <= n; i++) {
    if (a[i] > l) continue;
    if (play(l - a[i]) == 0) {
      state = 1;
      break;
    }
  }
  return dp[l] = state;
}
int main() {
  scanf("%d %d", &n, &k);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  memset(dp, -1, sizeof dp);
  if (play(k))
    printf("First\n");
  else
    printf("Second\n");
  return 0;
}
