#include <bits/stdc++.h>
using namespace std;
long long const mod1 = 998244353;
long long const mod = 1000000007;
const long long inf = LLONG_MAX;
long long toint(const string &s) {
  stringstream ss;
  ss << s;
  long long x;
  ss >> x;
  return x;
}
string tostring(long long number) {
  stringstream ss;
  ss << number;
  return ss.str();
}
struct cmp {
  bool operator()(pair<long long, long long> a, pair<long long, long long> b) {
    return (a.first < b.first);
  }
};
long long modexp(long long x, long long n) {
  if (n == 0) {
    return 1;
  } else if (n & 1) {
    return (modexp((x * x) % mod, n / 2) % mod * x % mod) % mod;
  } else {
    return (modexp((x * x) % mod, n / 2) % mod);
  }
}
long long modinv(long long n) { return modexp(n, mod - 2); }
long long gcd(long long a, long long b) {
  if (b == 0) {
    return a;
  }
  return gcd(b, a % b);
}
long long dp[100001][2];
long long n, k;
long long arr[101];
long long go(long long sum, long long turn) {
  if (sum < arr[0]) {
    return turn ^ 1;
  }
  if (dp[sum][turn] != -1) return dp[sum][turn];
  for (long long i = 0; i < n; i++) {
    long long op2 = go(sum - arr[i], turn ^ 1);
    if (op2 == turn) {
      return dp[sum][turn] = turn;
    }
  }
  return dp[sum][turn] = turn ^ 1;
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  memset(dp, -1, sizeof(dp));
  cin >> n >> k;
  for (long long i = 0; i < n; i++) {
    cin >> arr[i];
  }
  long long x = go(k, 0);
  if (x == 0)
    cout << "First";
  else {
    cout << "Second";
  }
}
