#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
int solve(int b[], int k, int n) {
  if (k < 0) return 1;
  if (k == 0) return 0;
  int sum = 1;
  for (int i = 0; i < n; i++) {
    int t = solve(b, k - b[i], n);
    sum = sum && t;
  }
  if (sum) return 0;
  return 1;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n, k;
  cin >> n >> k;
  int b[n];
  for (int i = 0; i < n; i++) cin >> b[i];
  if (solve(b, k, n))
    cout << "First\n";
  else
    cout << "Second\n";
}
