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