#include <bits/stdc++.h>
using namespace std;
vector<int> dp(100001, -1);
int fun(vector<int> v, int k, int c) {
  if (k < 0) return c;
  if (dp[k] == -1) {
    dp[k] = c == 1 ? 0 : 1;
    for (int i = 0; i < v.size(); i++)
      if (fun(v, k - v[i], dp[k]) == c) {
        dp[k] = c;
        break;
      }
  }
  return dp[k];
}
int main() {
  int n, k;
  cin >> n >> k;
  vector<int> v(n);
  for (int i = 0; i < n; i++) cin >> v[i];
  if (fun(v, k, 1) == 1)
    cout << "First";
  else
    cout << "Second";
  return 0;
}
