#include <bits/stdc++.h>
using namespace std;
const long long N = 100005, INF = 2000000000000000000;
long double pi = 3.1415926535897932;
long long power(long long a, long long b, long long p) {
  if (a == 0) return 0;
  long long res = 1;
  a %= p;
  while (b > 0) {
    if (b & 1) res = (res * a) % p;
    b >>= 1;
    a = (a * a) % p;
  }
  return res;
}
long long n, k;
long long dp[N], ar[101];
long long fun(long long cu) {
  if (cu < 0) return -1;
  if (dp[cu] != 0) return dp[cu];
  if (cu < ar[0]) return dp[cu] = -1;
  long long ans = 1;
  for (long long i = 0; i < n; i++) {
    ans = min(ans, fun(cu - ar[i]));
    if (ans == -1) break;
  }
  return dp[cu] = -1 * ans;
}
int32_t main() {
  cin >> n >> k;
  for (long long i = 0; i < n; i++) cin >> ar[i];
  sort(ar, ar + n);
  long long ans = fun(k);
  if (ans == -1)
    cout << "Second";
  else
    cout << "First";
}
