#include <bits/stdc++.h>
using namespace std;
int dp[100006];
int arr[106];
int n;
int fun(int k) {
  if (k == 0) return 0;
  if (dp[k] != -1) return dp[k];
  int ans = 0;
  for (int i = 0; i < n; i++) {
    if (arr[i] <= k) ans |= (!fun(k - arr[i]));
  }
  return dp[n] = ans;
}
int main() {
  int k;
  cin >> n >> k;
  for (int i = 0; i < n; i++) cin >> arr[i];
  for (int i = 0; i < k; i++) dp[i + 1] = -1;
  if (fun(k) == 0)
    cout << "Second" << endl;
  else
    cout << "First" << endl;
  return 0;
}
