#include <bits/stdc++.h>
using namespace std;
int dp[100002];
int n;
vector<int> a;
int fun(int k) {
  int mx = 0;
  for (int i = 0; i < n; ++i) {
    if (k - a[i] < 0) continue;
    mx = max(mx, (1 + fun(k - a[i])) % 2);
  }
  return mx;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int k;
  cin >> n >> k;
  a.resize(n);
  memset(dp, -1, sizeof dp);
  for (int i = 0; i < n; ++i) {
    cin >> a[i];
  }
  if (fun(k))
    cout << "First";
  else
    cout << "Second";
  return 0;
}
