#include <bits/stdc++.h>
using namespace std;
int dp[100001];
int A[100];
int n;
int f(int i) {
  if (i < A[0]) return 2;
  if (dp[i]) return dp[i];
  int mx = 2;
  for (int j = 0; j < n; ++j)
    if (f(i - A[j]) == 2) mx = 1;
  return dp[i] = mx;
}
int main() {
  int k;
  cin >> n >> k;
  for (int i = 0; i < n; ++i) cin >> A[i];
  if (f(k) == 1)
    cout << "First";
  else
    cout << "Second";
  return 0;
}
