#include <bits/stdc++.h>
using namespace std;
const int INF = 1001001001;
const int mod = 1000000007;
struct mint {
  long long x;
  mint(long long x = 0) : x((x % mod + mod) % mod) {}
  mint operator-() const { return mint(-x); }
  mint& operator+=(const mint a) {
    if ((x += a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator-=(const mint a) {
    if ((x += mod - a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator*=(const mint a) {
    (x *= a.x) %= mod;
    return *this;
  }
  mint operator+(const mint a) const { return mint(*this) += a; }
  mint operator-(const mint a) const { return mint(*this) -= a; }
  mint operator*(const mint a) const { return mint(*this) *= a; }
  mint pow(long long t) const {
    if (!t) return 1;
    mint a = pow(t >> 1);
    a *= a;
    if (t & 1) a *= *this;
    return a;
  }
  mint inv() const { return pow(mod - 2); }
  mint& operator/=(const mint a) { return *this *= a.inv(); }
  mint operator/(const mint a) const { return mint(*this) /= a; }
};
istream& operator>>(istream& is, const mint& a) { return is >> a.x; }
ostream& operator<<(ostream& os, const mint& a) { return os << a.x; }
vector<long long> a(105);
long long dp[105];
int n;
int dfs(int x) {
  if (dp[x] != -1) return dp[x];
  long long now = -1;
  for (long long i = 0; i < n; ++i) {
    if (x - a[i] < 0) continue;
    if (dfs(x - a[i]) == 0) now = 1;
  }
  if (now == 1)
    dp[x] = 1;
  else
    dp[x] = 0;
  return dp[x];
}
int main() {
  int k;
  cin >> n >> k;
  for (long long i = 0; i < n; ++i) {
    cin >> a[i];
  }
  for (long long i = 0; i < 105; ++i) dp[i] = -1;
  for (long long i = 0; i < a[0]; ++i) dp[i] = 0;
  long long ans = dfs(k);
  if (ans == 1)
    cout << "First";
  else
    cout << "Second";
  return 0;
}
