#include <bits/stdc++.h>
using namespace std;
int n, k;
int stones[100], dp[100001];
int f(int x) {
  if (x < 0) return 1;
  if (x == 0) return 0;
  if (dp[x] > -1) return dp[x];
  int res = 0;
  for (int i = 0; i < n; i++) res = res || f(x - stones[i]);
  return dp[x] = res;
}
signed main() {
  ios_base::sync_with_stdio(false), cin.tie(nullptr);
  cin >> n >> k;
  for (int i = 0; i < n; i++) cin >> stones[i];
  for (int i = 0; i <= k; i++) dp[i] = -1;
  cout << (f(k) ? "First" : "Second");
}
