#include <bits/stdc++.h>
template <typename X>
std::ostream& operator<<(std::ostream& out, std::vector<X> v) {
  for (auto& i : v) out << i << " ";
  return out;
}
template <typename X, typename Y>
std::ostream& operator<<(std::ostream& out, std::pair<X, Y> p) {
  out << p.first << " " << p.second;
  return out;
}
static const long long mod = 1000000007;
using namespace std;
long long n, k;
std::vector<long long> a(100005);
int dp[100005];
bool stones(long long val) {
  if (dp[val] != -1) return dp[val];
  if (val < 0) return 1;
  int flag = 0;
  for (long long i = 0; i < (long long)n; i++) {
    flag = flag or !stones(val - a[i]);
  }
  return dp[val] = flag;
}
int main() {
  ios::sync_with_stdio(false);
  std::cin.tie(0);
  std::cout.tie(0);
  cin >> n >> k;
  a.resize(n);
  for (long long i = 0; i < (long long)n; i++) cin >> a[i];
  sort(a.begin(), a.end());
  memset(dp, -1, sizeof dp);
  for (long long i = 0; i < (long long)a[0]; i++) dp[i] = false;
  if (stones(k) == 1)
    cout << "First"
         << "\n";
  else
    cout << "Second"
         << "\n";
  return 0;
}
