#include <bits/stdc++.h>
using namespace std;
int n, k;
int arr[110];
int dp[110];
bool find(int k) {
  if (k == 0) return false;
  if (dp[k] != -1) return dp[k];
  bool second = true;
  for (int i = 0; i < n; i++) {
    if (k - arr[i] >= 0) second = second && find(k - arr[i]);
  }
  if (second == true) return dp[k] = false;
  return dp[k] = true;
}
int main() {
  memset(dp, -1, sizeof(dp));
  cin >> n >> k;
  for (int i = 0; i < n; i++) cin >> arr[i];
  if (find(k))
    cout << "First" << endl;
  else
    cout << "Second" << endl;
}
