#include <bits/stdc++.h>
using namespace std;
int ways(int n, int k, int stones[]) {
  bool dp[n + 1][k + 1];
  memset(dp, false, sizeof dp);
  dp[0][0] = false;
  for (int i = 0; i <= n; i++) {
    for (int j = 0; j <= k; j++) {
      if (stones[i - 1] <= j && dp[i - 1][j - stones[i - 1]] == false) {
        dp[i][j] = true;
      }
    }
  }
  return dp[n][k];
}
int main() {
  int n, k;
  cin >> n >> k;
  int stones[n];
  for (int i = 0; i < n; i++) {
    cin >> stones[i];
  }
  bool ans = ways(n, k, stones);
  if (ans) {
    cout << "First";
  } else
    cout << "Second";
}
