#include <bits/stdc++.h>
using namespace std;
int n, k;
int a[1000005], f[1000005];
int solve(int x) {
  if (f[x] != -1) return f[x];
  if (x == 0) return f[x] = 0;
  int ret = 0;
  for (int i = 1; i <= n; i++) {
    if (x >= a[i]) ret |= (solve(x - a[i]) ^ 1);
  }
  return ret;
}
int main() {
  scanf("%d%d", &n, &k);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  memset(f, -1, sizeof(f));
  puts(solve(k) ? "First" : "Second");
  return 0;
}
