#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, k;
  cin >> n >> k;
  int a[n];
  int b[k + 1];
  memset(b, 0, (k + 1) * sizeof(b[0]));
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    b[a[i]] = 1;
  }
  long long c = 0;
  while (k != 0) {
    if (k <= a[n - 1] && b[k] == 1) {
      c++;
      k = 0;
    } else {
      int check = 0;
      for (int i = 0; i < n; i++) {
        if ((k - a[i]) > 0 && b[k - a[i]] != 1) {
          c++;
          check = 1;
          k = k - a[i];
          break;
        }
      }
      if (check == 0) {
        break;
      }
    }
  }
  if (c % 2 == 0) {
    cout << "Second" << '\n';
  } else {
    cout << "First" << '\n';
  }
}
