#include <bits/stdc++.h>
using namespace std;
int main() {
  long long n, pile;
  cin >> n >> pile;
  long long set[n];
  for (long long i = 0; i < n; i++) {
    cin >> set[i];
  }
  sort(set, set + n);
  long long dp[pile + 1];
  long long k = 0;
  while (k <= set[0]) {
    dp[k] = k / set[0];
    k++;
  }
  long long v;
  for (long long u = set[0]; u <= pile; u++) {
    bool ok = false;
    for (v = 0; v < n; v++) {
      if ((dp[u - set[v]] + 1) % 2 != 0) {
        dp[u] = dp[u - set[v]] + 1;
        ok = true;
        break;
      }
    }
    if (!ok) dp[u] = dp[u - set[0]] + 1;
  }
  if (dp[pile] % 2 == 0)
    cout << "Second";
  else
    cout << "First";
  return 0;
}
