#include <bits/stdc++.h>
using namespace std;
int n, k;
vector<int> arr;
int dp[100001][2];
int solve(int left, int mover) {
  if (dp[left][mover] != -1) return dp[left][mover];
  if (mover == 0) {
    for (int i = 0; i < n; i++) {
      if (arr[i] == left) return dp[left][mover] = 0;
      if (left > arr[i]) {
        if (solve(left - arr[i], 1) == 0) return 0;
      }
    }
    return 1;
  } else {
    for (int i = 0; i < n; i++) {
      if (arr[i] == left) return dp[left][mover] = 1;
      if (left > arr[i]) {
        if (solve(left - arr[i], 0) == 1) return 1;
      }
    }
    return 0;
  }
  return 1;
}
int main() {
  cin >> n >> k;
  arr.resize(n);
  for (int i = 0; i <= k; i++) {
    dp[i][0] = dp[i][1] = -1;
  }
  for (int i = 0; i < n; i++) cin >> arr[i];
  if (solve(k, 0) == 0)
    cout << "First";
  else
    cout << "Second";
  return 0;
}
