#include <bits/stdc++.h>
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
long long n;
long long a[101] = {0};
priority_queue<long long> p;
void f(long long i, long long k) {
  if (i == n) i = 1;
  if (k <= 0) return;
  for (long long i = 1; i <= n; i++) {
    long long q = 0;
    if (k - a[i] >= 0) {
      q++;
      f(i + 1, k - a[i]);
      p.push(q % 2);
    }
  }
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long k;
  cin >> n >> k;
  for (long long i = 1; i <= n; i++) {
    cin >> a[i];
  }
  f(1, k);
  long long z = 0;
  while (!p.empty()) {
    if (p.top() == 1) {
      z = 1;
      break;
    }
    p.pop();
  }
  if (z == 1)
    cout << "First";
  else
    cout << "Second";
  return 0;
}
