#include <bits/stdc++.h>
using namespace std;
int n, k;
bool find(bool curr, int arr[], int rem) {
  if (rem < 0) return curr;
  bool ok = false;
  for (int j = 0; j < n; j++) {
    bool flag = find(!curr, arr, rem - arr[j]);
    if (flag == curr) ok = true;
  }
  if (ok) return curr;
  return !curr;
}
int main() {
  cin >> n >> k;
  int arr[n];
  for (int i = 0; i < n; i++) cin >> arr[i];
  if (find(true, arr, k))
    cout << "First";
  else
    cout << "Second";
  return 0;
}
