#include <bits/stdc++.h>
using namespace std;
int stone(int k, int mini, vector<int>& dp, int arr[], int n) {
  if (k == 0) return dp[k] = 0;
  if (dp[k] != -1) return dp[k];
  int res = 0;
  for (int i = 1; i <= n; i++) {
    if (arr[i] > k) continue;
    if (stone(k - arr[i], mini, dp, arr, n) == 0) {
      res = 1;
      break;
    }
  }
  return dp[k] = res;
}
int main() {
  ios_base ::sync_with_stdio(false);
  cin.tie(NULL);
  int n, k;
  cin >> n >> k;
  int arr[102];
  int mini = 1000000;
  vector<int> dp(k, -1);
  for (int i = 1; i <= n; i++) {
    cin >> arr[i];
    if (arr[i] < mini) mini = arr[i];
  }
  if (stone(k, mini, dp, arr, n) % 2 == 1)
    cout << "First";
  else
    cout << "Second";
  return 0;
}
