#include <bits/stdc++.h>
using namespace std;
int n, k;
int a[100000];
int dp[100001];
bool rec(int rest) {
  if (~dp[rest]) return dp[rest];
  for (int i = 0; i < n; i++) {
    if (rest - a[i] < 0) continue;
    if (!rec(rest - a[i])) return dp[rest] = true;
  }
  return dp[rest] = false;
}
int main() {
  scanf("%d %d", &n, &k);
  for (int i = 0; i < n; i++) scanf("%d", &a[i]);
  memset(dp, -1, sizeof(dp));
  if (rec(k))
    printf("First\n");
  else
    printf("Second\n");
  return 0;
}
