#include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string &s) { return '"' + s + '"'; }
string to_string(const char *s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
string to_string(vector<bool> v) {
  bool first = true;
  string res = "{";
  for (int i = 0; i < static_cast<int>(v.size()); i++) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(v[i]);
  }
  res += "}";
  return res;
}
template <size_t N>
string to_string(bitset<N> v) {
  string res = "";
  for (size_t i = 0; i < N; i++) {
    res += static_cast<char>('0' + v[i]);
  }
  return res;
}
template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto &x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}
template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " +
         to_string(get<2>(p)) + ")";
}
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " +
         to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}
using namespace std;
constexpr int maxn = 200000;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long A[maxn + 1];
struct Node {
  long long ans, sum, size;
  Node operator+(const Node &node) const {
    Node res;
    res.size = size + node.size;
    if (size & 1)
      res.sum = sum - node.sum;
    else
      res.sum = sum + node.sum;
    if (size & 1)
      res.ans = ans - node.ans - size * node.sum;
    else
      res.ans = ans + node.ans + size * node.sum;
    return res;
  }
} T[maxn << 2];
void build(int v, int tl, int tr) {
  if (tl == tr) {
    T[v].size = 1;
    T[v].ans = T[v].sum = A[((tl + tr) >> 1)];
  } else {
    build((v << 1), tl, ((tl + tr) >> 1));
    build(((v << 1) | 1), ((tl + tr) >> 1) + 1, tr);
    T[v] = T[(v << 1)] + T[((v << 1) | 1)];
  }
}
void update(int v, int tl, int tr, int x, int V) {
  if (tl == tr) {
    T[v].ans = T[v].sum = V;
  } else {
    if (x <= ((tl + tr) >> 1))
      update((v << 1), tl, ((tl + tr) >> 1), x, V);
    else
      update(((v << 1) | 1), ((tl + tr) >> 1) + 1, tr, x, V);
    T[v] = T[(v << 1)] + T[((v << 1) | 1)];
  }
}
Node query(int v, int tl, int tr, int l, int r) {
  if (l <= tl and tr <= r) return T[v];
  if (r <= ((tl + tr) >> 1)) return query((v << 1), tl, ((tl + tr) >> 1), l, r);
  if (l > ((tl + tr) >> 1))
    return query(((v << 1) | 1), ((tl + tr) >> 1) + 1, tr, l, r);
  return query((v << 1), tl, ((tl + tr) >> 1), l, r) +
         query(((v << 1) | 1), ((tl + tr) >> 1) + 1, tr, l, r);
}
int a[110];
unordered_set<int> vis;
int dp[(int)1e5 + 10];
int mx = 0;
int dfs(int p) {
  if (p == 0 or (p <= mx and !vis.count(p))) {
    return 0;
  }
  cerr << "["
       << "p"
       << "]:",
      debug_out(p);
  if (dp[p] != -1) return dp[p];
  for (auto x : vis) {
    if (p >= x and !dfs(p - x)) {
      dp[p] = 1;
      return 1;
    }
  }
  dp[p] = 0;
  return 0;
}
void solve() {
  int n, k;
  cin >> n >> k;
  for (int i = 0; i < n; ++i) cin >> a[i], vis.insert(a[i]), mx = max(mx, a[i]);
  memset(dp, -1, sizeof dp);
  if (n == 1) {
    if (k % (2 * a[0]) == 0 or (k % (2 * a[0]) != a[0])) {
      cout << "Second" << endl;
    } else
      cout << "First" << endl;
    return;
  }
  int t = dfs(k);
  if (t == 0)
    cout << "Second" << endl;
  else
    cout << "First" << endl;
}
int main() {
  std::ios::sync_with_stdio(false);
  cin.tie(0);
  int t = 1;
  for (int i = 1; i <= t; ++i) {
    solve();
  }
  return 0;
}
