#include <bits/stdc++.h>
using namespace std;
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
  os << '{';
  string sep;
  for (const auto &x : v) os << sep << x, sep = ", ";
  return os << '}';
}
template <typename T, size_t size>
ostream &operator<<(ostream &os, const array<T, size> &arr) {
  os << '{';
  string sep;
  for (const auto &x : arr) os << sep << x, sep = ", ";
  return os << '}';
}
template <typename A, typename B>
ostream &operator<<(ostream &os, const pair<A, B> &p) {
  return os << '(' << p.first << ", " << p.second << ')';
}
void dbg_out() { cerr << '\n'; }
template <typename Head, typename... Tail>
void dbg_out(Head H, Tail... T) {
  cerr << ' ' << H;
  dbg_out(T...);
}
const long long N = 1e5 + 5, mod = 1e9 + 7, bit = 61;
long long dp[2][N];
long long a[101];
long long n, k;
long long solve(long long who, long long stones) {
  if (stones < a[1]) {
    return (who ^ 1);
  }
  assert(stones >= 0);
  long long &ans = dp[who][stones];
  if (ans != -1) {
    return ans;
  }
  ans = who ^ 1;
  long long beg = lower_bound(a + 1, a + n + 1, stones) - a;
  for (long long i = beg; i <= n; i++) {
    if (solve(who ^ 1, stones - a[i]) == who) {
      ans = who;
      break;
    }
  }
  return ans;
}
signed main() {
  ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
  long long t = 1;
  while (t--) {
    cin >> n >> k;
    for (long long i = 1; i <= n; i++) {
      cin >> a[i];
    }
    memset(dp, -1, sizeof(dp));
    if (solve(1, k)) {
      cout << "First" << '\n';
    } else {
      cout << "Second" << '\n';
    }
  }
  return 0;
}
