#include <bits/stdc++.h>
using namespace std;
long long int n;
int dp[100005];
int a[105];
int rec(int rem) {
  cout << rem << endl;
  if (rem == 0) return 0;
  int &res = dp[rem];
  if (res != -1) return res;
  res = 0;
  for (int i = 0; i < n; i++) {
    if (rem - a[i] >= 0) {
      if (rec(rem - a[i]) == 0) res = 1;
    }
  }
  return res;
}
int main() {
  int k;
  cin >> n >> k;
  for (int i = 0; i < n; i++) cin >> a[i];
  memset(dp, -1, sizeof(dp));
  if (rec(k))
    cout << "First";
  else
    cout << "Second";
  return 0;
}
