#include <bits/stdc++.h>
using namespace std;
int n, k, ar[100055], dp[100055];
int solve(int kk) {
  if (kk == 0) return 0;
  return !solve(kk - 1);
  int &ret = dp[kk];
  if (~ret) return ret;
  int res = 0;
  for (int i = 1; i <= n; ++i) {
    if (kk - ar[i] >= 0) res = max(res, 1 ^ solve(kk - ar[i]));
    if (res) break;
  }
  return ret = res;
}
int main() {
  memset(dp, -1, sizeof dp);
  scanf("%d%d", &n, &k);
  for (int i = 1; i <= n; ++i) {
    scanf("%d", &ar[i]);
  }
  cout << (solve(k) ? "First" : "Second");
  return 0;
}
