#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
int n, k, a[110], dp[100010];
int dfs(int lft) {
  if (dp[lft] != -1) return dp[lft];
  for (int i = 0; i < n; i++)
    if (lft - a[i] >= 0 && dfs(lft - a[i]) == 0) return dp[lft] = 1;
  return dp[lft] = 0;
}
int main() {
  cin >> n >> k;
  for (int i = 0; i < n; i++) cin >> a[i];
  for (int i = 0; i < 105; i++) dp[i] = -1;
  if (dfs(k) == 1)
    puts("First");
  else
    puts("Second");
  return 0;
}
