#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
int n, k, a[150], dp[200005][105];
bool f(int sum, int rand, int wa) {
  if (sum > k) {
    if (rand % 2)
      return 0;
    else
      return 1;
  }
  if (dp[rand][wa] != -1) return dp[rand][wa];
  bool t = false;
  for (int i = 0; i < n; i++) {
    bool x = f(sum + a[i], rand + 1, i);
    if (rand % 2) {
      if (x == 0) t = true;
    } else {
      if (x == 1) t = true;
    }
  }
  if (rand % 2) {
    if (t == true)
      return dp[rand][wa] = 0;
    else
      return dp[rand][wa] = 1;
  } else {
    if (t == true)
      return dp[rand][wa] = 1;
    else
      return dp[rand][wa] = 0;
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  memset(dp, -1, sizeof dp);
  cin >> n >> k;
  for (int i = 0; i < n; i++) cin >> a[i];
  bool t = f(0, 0, 0);
  if (t == 0)
    cout << "Second";
  else
    cout << "First";
}
