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