#include <bits/stdc++.h>
using namespace std;
int n, k;
int a[100001], win[100001];
void dfs(int stones) {
  bool first_win = false;
  for (int i = 0; i < n; ++i) {
    if (win[stones - a[i]] == 0) dfs(stones - a[i]);
    if (win[stones - a[i]] == 2) {
      first_win = true;
      break;
    }
  }
  win[stones] = (first_win ? 1 : 2);
}
int main() {
  cin >> n;
  cin >> k;
  for (int i = 0; i < n; ++i) cin >> a[i];
  for (int i = 0; i < a[0]; ++i) win[i] = 2;
  dfs(k);
  cout << (win[k] == 1 ? "First" : "Second") << "\n";
}
