#include <bits/stdc++.h>
using namespace std;
int n, k;
vector<int> a;
int optimal(int stones) {
  int i = 0;
  while (a[i] <= stones && i < n) {
    int moves = 1 + optimal(stones - a[i]);
    if (moves % 2 == 1) return moves;
    i++;
  }
  return 0;
}
void aksayushx() {
  cin >> n >> k;
  a.resize(n);
  for (int i = 0; i < n; i++) cin >> a[i];
  int win = optimal(k);
  if (win % 2 == 1)
    cout << "First";
  else
    cout << "Second";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int test = 1;
  while (test--) aksayushx();
  return 0;
}
