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