#include <bits/stdc++.h>
using namespace std;
bool playgame(int currentplayer, int n, int k, int steps[], int dp[][2]) {
  if (dp[k][currentplayer] != -1) {
    return (dp[k][currentplayer] == 0 ? false : true);
  }
  int nextplayer = (currentplayer == 0 ? 1 : 0);
  for (int i = 0; i < n; i++) {
    if (k - steps[i] >= 0) {
      bool cannextplayerwin = playgame(nextplayer, n, k - steps[i], steps, dp);
      if (cannextplayerwin == false) {
        return true;
      }
    }
  }
  dp[k][currentplayer] = 0;
  return false;
}
void findit(int n, int k, int steps[]) {
  int dp[100001][2];
  for (int i = 0; i <= 100001; i++) {
    for (int j = 0; j < 2; j++) {
      dp[i][j] = -1;
    }
  }
  int answer = playgame(0, n, k, steps, dp);
  if (answer) {
    cout << "First";
  } else
    cout << "Second";
}
int main() {
  int n;
  cin >> n;
  int k;
  cin >> k;
  int steps[n];
  for (int i = 0; i < n; i++) {
    cin >> steps[i];
  }
  findit(n, k, steps);
  return 0;
}
