#include <bits/stdc++.h>
using namespace std;
long long a[100005] = {0};
long long n, k;
long long hod[105] = {0};
long long rec(long long k) {
  if (a[k] != -1) return a[k];
  bool *b = new bool[105];
  for (long long i = 1; i <= n; i++) {
    if (hod[i] <= k)
      b[rec(k - hod[i])] = 1;
    else
      break;
  }
  for (long long i = 0; i <= 105; i++) {
    if (!b[i]) {
      a[k] = i;
      delete b;
      return i;
    }
  }
}
int main() {
  cin.tie(0);
  cout.tie(0);
  ios_base::sync_with_stdio(false);
  cin >> n >> k;
  for (long long i = 1; i <= k; i++) {
    a[i] = -1;
  }
  for (long long i = 1; i <= n; i++) {
    cin >> hod[i];
  }
  stable_sort(hod + 1, hod + 1 + n);
  a[0] = 0;
  if (rec(k) == 0)
    cout << "Second";
  else
    cout << "First";
}
