#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
long long power(long long x, long long y, long long p) {
  long long res = 1;
  x = x % p;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
const long long L = 1e5 + 5;
long long arr[105], n;
long long dp[L][5];
long long mv = 1e18;
long long rec(long long k, long long t) {
  long long i;
  if (k < 0) return -1;
  if (mv > k) return dp[k][t] = -1;
  if (dp[k][t] != 0) return dp[k][t];
  for (i = 0; i < n; i++) {
    if (rec(k - arr[i], 1 - t) == -1) return dp[k][t] = 1;
  }
  return dp[k][t] = -1;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long i, k;
  cin >> n >> k;
  for (i = 0; i < n; i++) cin >> arr[i], mv = min(mv, arr[i]);
  if (rec(k, 0) == 1)
    cout << "First" << endl;
  else
    cout << "Second" << endl;
  return 0;
}
