#include <bits/stdc++.h>
using namespace std;
bool helper(vector<int>& v, int k, int p, vector<int>& ans) {
  if (k < v[0]) {
    if (p == 1) {
      return true;
    }
    if (p == 0) {
      return false;
    }
  }
  if (ans[k] != -1) return ans[k];
  bool c;
  if (p == 0) c = false;
  if (p == 1) c = true;
  for (int i = 0; i < v.size(); i++) {
    if (v[i] <= k) {
      if (p == 0) {
        c = c || helper(v, k - v[i], (p + 1) % 2, ans);
        if (c == true) break;
      }
      if (p == 1) {
        c = c && helper(v, k - v[i], (p + 1) % 2, ans);
        if (c == false) break;
      }
    }
  }
  ans[k] = c;
  return c;
}
int main() {
  int n, k;
  cin >> n >> k;
  vector<int> v(n);
  for (int i = 0; i < n; i++) cin >> v[i];
  sort(v.begin(), v.end());
  vector<int> ans(k + 1, -1);
  bool z = helper(v, k, 0, ans);
  if (z == 1) {
    cout << "First";
  } else {
    cout << "Second";
  }
}
