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