#include <bits/stdc++.h>
using namespace std;
long long mod = 1e9 + 7;
int main() {
  int n, k;
  cin >> n, k;
  int a[n];
  for (int i = 0; i < n; i++) cin >> a[i];
  bool p[k + 1];
  p[0] = false;
  for (int i = 0; i < k + 1; i++) {
    bool q = false;
    for (int j = 0; j < n; j++) {
      if (i - a[j] >= 0 && !p[i - a[j]]) {
        q = true;
      }
    }
    p[i] = q;
  }
  if (p[k])
    cout << "First" << endl;
  else
    cout << "Second" << endl;
}
