#include <bits/stdc++.h>
using namespace std;
const int MAXK = 1e5 + 5;
const int MAXN = 1e2 + 2;
int n, k;
int a[MAXN], dp[MAXK][5];
bool dfs(int K, int T) {
  if (dp[K][T] >= 0) return dp[K][T];
  int ans = 0;
  for (int i = 1; i <= n; i++)
    if (k >= a[i]) ans |= !dfs(K - a[i], !T);
  return dp[K][T] = ans;
}
int main() {
  scanf("%d%d", &n, &k);
  memset(dp, -1, sizeof(dp));
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  bool flag = dfs(k, 0);
  if (flag)
    puts("First");
  else
    puts("Second");
  return 0;
}
