#include <bits/stdc++.h>
using namespace std;
const int MAXN = 112;
const int MAXK = 112345;
int n, k;
int vals[MAXN];
int vis[MAXK][2];
bool dp[MAXK][2];
bool solve(int r, int t) {
  if (vis[r][t]) return dp[r][t];
  vis[r][t] = 1;
  bool winner;
  if (t) {
    winner = 0;
    for (int i = 0; i < n; i++) {
      if (r - vals[i] >= 0) winner |= solve(r - vals[i], !t);
    }
  } else {
    winner = 1;
    for (int i = 0; i < n; i++) {
      if (r - vals[i] >= 0) winner &= solve(r - vals[i], !t);
    }
  }
}
int main() {
  scanf("%d%d", &n, &k);
  for (int i = 0; i < n; i++) {
    scanf("%d", &vals[i]);
  }
  if (solve(k, 0))
    printf("Second\n");
  else
    printf("First\n");
}
