#include <bits/stdc++.h>
using namespace std;
int n, k, dp[105][2];
int a[105];
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() {
  memset(dp, -1, sizeof(dp));
  scanf("%d%d", &n, &k);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  if (dfs(k, 0))
    puts("First");
  else
    puts("Second");
}
