#include <bits/stdc++.h>
using namespace std;
int const N = 101, K = 1e5 + 1;
int n, k, mn = K;
int arr[N];
bool dp[K][2];
bool vis[K][2];
bool pound(int stones, bool turn) {
  if (stones < mn) return turn;
  if (vis[stones][turn]) return dp[stones][turn];
  vis[stones][turn] = 1;
  dp[stones][turn] = turn;
  for (int i = 0; i < n; ++i) {
    if (turn)
      dp[stones][turn] = min(dp[stones][turn], pound(stones - arr[i], !turn));
    else
      dp[stones][turn] = max(dp[stones][turn], pound(stones - arr[i], !turn));
  }
  return dp[stones][turn];
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> n >> k;
  for (int i = 0; i < n; ++i) cin >> arr[i], mn = min(mn, arr[i]);
  if (pound(k, 0))
    cout << "First";
  else
    cout << "Second";
  return 0;
}
