#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, k;
  cin >> n >> k;
  int a[n];
  for (int i = 0; i < n; i++) cin >> a[i];
  sort(a, a + n);
  bool dp[k + 1];
  int used[k + 1];
  for (int i = 0; i < k + 1; i++) {
    dp[i + 1] = false;
  }
  dp[0] = false;
  for (int i = 1; i <= (int)(k); i++) {
    for (int j = 0; j < n; j++) {
      if (i - a[j] < 0) break;
      dp[i] |= !dp[i - a[j]];
      if (dp[i]) break;
    }
  }
  if (dp[k])
    cout << "First" << endl;
  else
    cout << "Second" << endl;
  return 0;
}
