#include <bits/stdc++.h>
using namespace std;
const int N = 105, M = 1000005;
const long long MOD = 1e9 + 7;
const double eps = 1e-9;
int n, k, a[N], dp[2][100005];
int calc(int i, int rem) {
  if (rem == 0) return i ^ 1;
  int &r = dp[i][rem];
  if (r != -1) return r;
  r = i ^ 1;
  for (int j = 0; j < n; j++)
    if (rem >= a[i] && calc(i ^ 1, rem - a[j]) == i) {
      r = i;
      break;
    }
  return r;
}
int main() {
  scanf("%d%d", &n, &k);
  for (int i = 0; i < n; i++) scanf("%d", a + i);
  memset(dp, -1, sizeof dp);
  printf("%s\n", calc(0, k) == 0 ? "First" : "Second");
  return 0;
}
