#include <bits/stdc++.h>
using namespace std;
int const maxn = 101;
int const maxk = 101010;
int n;
int w[maxn];
int dp[maxk];
int solve(int k) {
  int& d = dp[k];
  if (d != -1) return d;
  d = 0;
  for (int i = 0; i < n; i++) {
    if (w[i] <= k) d |= ~solve(k - w[i]);
  }
  return d;
}
int main() {
  ios::sync_with_stdio(false), cin.tie(nullptr);
  int k;
  cin >> n >> k;
  for (int i = 0; i < n; i++) {
    cin >> w[i];
  }
  memset(dp, -1, sizeof(dp));
  if (solve(k)) {
    cout << "First\n";
  } else {
    cout << "Second\n";
  }
}
