#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 5;
int main() {
  int n, k, mn = INF;
  bool win = false;
  cin >> n >> k;
  vector<int> dp(k + 1);
  vector<int> in(n);
  for (int i = 0; i < n; i++) {
    cin >> in[i];
    mn = min(mn, in[i]);
  }
  for (int i = 0; i < mn; i++) dp[i] = 1;
  for (int i = 0; i <= k - mn; i++) {
    for (int j = 0; j < n; j++) {
      if (i + in[j] <= k)
        if (dp[i + in[j]] <= dp[i]) dp[i + in[j]] = dp[i] + 1;
    }
  }
  for (int j = 0; j < n; j++)
    if (dp[k - in[j]] % 2) win = true;
  if (win)
    printf("First");
  else
    printf("Second");
}
