#include <bits/stdc++.h>
using namespace std;
void stones(long long int n, long long int k, vector<long long int>& arr) {
  vector<vector<long long int> > dp(n, vector<long long int>(k + 1, 0));
  for (long long int i = 0; i < k + 1; i++) {
    if (i - arr[0] >= 0) {
      if (dp[0][i - arr[0]] == 0) {
        dp[0][i] = 1;
      }
    }
  }
  for (long long int i = 1; i < n; i++) {
    for (long long int j = 0; j < k + 1; j++) {
      if (j - arr[i] >= 0) {
        if (dp[i][j - arr[i]] == 0) {
          dp[i][j] = 1;
        } else {
          dp[i][j] = dp[i - 1][j];
        }
      } else {
        dp[i][j] = dp[i - 1][j];
      }
    }
  }
  if (dp[n - 1][k]) {
    cout << "First" << endl;
  } else {
    cout << "Second" << endl;
  }
  return;
}
int main() {
  std::ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long int n, k;
  cin >> n >> k;
  vector<long long int> a(n, 0);
  for (long long int i = 0; i < n; i++) {
    cin >> a[i];
  }
  stones(n, k, a);
  return 0;
}
