#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 55;
bool dp[N];
int main() {
  int n, k;
  cin >> n >> k;
  int a[n];
  for (int i = 0; i < n; i++) cin >> a[i];
  dp[0] = 1;
  for (int i = 1; i <= k; i++) {
    bool q = 0;
    for (int j = 0; j < n; j++) {
      if (i >= a[j] && dp[i - a[j]] == 0) q = 1;
    }
    dp[i] = q;
  }
  if (dp[k])
    cout << "Second" << endl;
  else
    cout << "First" << endl;
  return 0;
}
