#include <bits/stdc++.h>
using namespace std;
int n, k, a[101];
bool can[200001];
int main() {
  cin >> n >> k;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
  }
  for (int i = k; i >= 1; i--) {
    bool mn = 1, mx = 0;
    for (int j = 1; j <= n; j++) {
      mn = min(can[a[j] + i], mn);
      mx = max(mx, can[a[j] + i]);
    }
    assert(mn != mx);
    if (!mn) {
      can[i] = 1;
    }
  }
  if (can[0]) {
    cout << "First";
  } else {
    cout << "Second";
  }
}
