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