#include <bits/stdc++.h>
using namespace std;
bool dp[100001], visited[100001];
int a[100001];
int n, k;
bool f(int q) {
  cout << q << endl;
  if (q < 0) return 0;
  if (visited[q]) return dp[q];
  bool val = 0;
  for (int i = 0; i < n; i++) val |= f(q - a[i]);
  dp[q] = !val;
  visited[q] = 1;
  return dp[q];
}
int main() {
  cin >> n >> k;
  for (int i = 0; i < n; i++) cin >> a[i];
  memset(dp, 0, 100001 * sizeof(bool));
  if (!f(k))
    cout << "First" << endl;
  else
    cout << "Second" << endl;
  return 0;
}
