#include <bits/stdc++.h>
using namespace std;
int n, k, a[105], dp[10011];
set<int> st;
int main() {
  cin >> n >> k;
  for (int i = 0; i < n; i++) cin >> a[i];
  for (int i = 1; i <= k; i++) {
    st = {};
    for (int j = 0; j < n; j++) {
      if (a[j] > i) continue;
      st.insert(dp[i - a[j]]);
    }
    int mex = 0;
    while (st.find(mex) != st.end()) mex++;
    dp[i] = mex;
  }
  printf("%s", dp[k] != 0 ? "First" : "Second");
  return 0;
}
