#include <bits/stdc++.h>
using namespace std;
string solve(vector<int>& v, int k) {
  bool dp[k + 1];
  memset(dp, 0, sizeof dp);
  for (int move : v) {
    for (int i = k; i >= 1; i--) {
      if (move > i) continue;
      if (dp[i - move] == 0) dp[i] = 1;
    }
  }
  return dp[k] ? "First" : "Second";
}
int main() {
  int n, k;
  cin >> n >> k;
  vector<int> v(n);
  for (int i = 0; i <= n; i++) cin >> v[i];
  cout << solve(v, k);
  return 0;
}
