#include <bits/stdc++.h>
using namespace std;
vector<vector<long long int>> dp;
long long int n, k;
vector<long long int> arr;
long long int solve(long long int left = k, long long int chance = 0) {
  if (left <= 0) {
    return !chance;
  }
  if (dp[chance][left] != -1) {
    return dp[chance][left];
  }
  long long int ans = chance;
  for (long long int i = 0; i < n; i++) {
    long long int temp = left - arr[i];
    if (temp >= 0 && temp < arr[0]) {
      dp[chance][left] = chance;
      return chance;
    }
  }
  for (long long int i = 0; i < n; i++) {
    if (solve(left - arr[i], !chance) == chance) {
      dp[chance][left] = chance;
    }
  }
  if (dp[chance][left] == -1) {
    dp[chance][left] = !chance;
  }
  return dp[chance][left];
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> k;
  dp.assign(2, vector<long long int>(k + 1, -1));
  arr.assign(n + 1, 0);
  for (long long int i = 0; i < n; i++) cin >> arr[i];
  long long int ans = solve();
  cout << (ans ? "Second" : "First") << endl;
  return 0;
}
