#include <bits/stdc++.h>
using namespace std;
int solve(int a[], int n, int k, int p) {
  if (k < 0) return p;
  for (int i = 0; i < n; i++) {
    int so = solve(a, n, k - a[i], p ^ 1);
    if (so == p) return p;
  }
  return p ^ 1;
}
int main() {
  int n, k;
  cin >> n >> k;
  int a[n];
  for (int i = 0; i < n; i++) cin >> a[i];
  int so = solve(a, n, k, 0);
  if (so == 0)
    cout << "First\n";
  else
    cout << "Second\n";
  return 0;
}
