#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
using ll = long long;
const char E = '\n';
const int N = 100005;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n, k, a[N], dp[N] = {0};
  bool used[N] = {0};
  cin >> n >> k;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    for (int j = a[i]; j <= k; j++) {
      used[j] = 0;
      if (dp[j - a[i]] % 2 == 1) continue;
      if (j == k || dp[j]) {
        if (!dp[j - a[i]]) used[j - a[i]] = 1;
        dp[j - a[i]] = dp[j] + 1;
      }
    }
  }
  bool win = 0;
  for (int i = 0; i < k; i++) {
    if (used[i]) {
      if (dp[i] % 2 == 1) win = 1;
      break;
    }
  }
  cout << ((win) ? "First" : "Second");
  return 0;
}
