#include <bits/stdc++.h>
using namespace std;
long long n, k;
long long dp[100001][3];
long long fun(long long k, long long cnt, long long a[]) {
  if (k < a[0]) {
    return 3 - cnt;
  }
  if (dp[k][cnt] != -1) return dp[k][cnt];
  long long ck = 0;
  for (long long i = 0; i < n; i++) {
    if (fun(k - a[i], 3 - cnt, a) == cnt) {
      ck = 1;
      break;
    }
  }
  if (ck == 1)
    return dp[k][cnt] = cnt;
  else
    return dp[k][cnt] = 3 - cnt;
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> n >> k;
  for (long long i = 0; i < 100001; i++)
    for (long long j = 0; j < 3; j++) dp[i][j] = -1;
  long long a[n];
  for (long long i = 0; i < n; i++) cin >> a[i];
  if (fun(k, 1, a) == 1)
    cout << "First"
         << "\n";
  else
    cout << "Second"
         << "\n";
  return 0;
}
