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