#include <bits/stdc++.h>
using namespace std;
void fastio() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
}
long long int n, k;
long long int a[100005];
int dp[100005][2];
int solve(int k1, int flag) {
  if (dp[k1][flag] != -1) return dp[k1][flag];
  int ans = 0;
  for (int i = 0; i < n; i++) {
    if (a[i] <= k1) ans |= 1 - solve(k1 - a[i], 1 - flag);
  }
  dp[k1][flag] = ans;
  dp[k1][1 - flag] = 1 - ans;
  return ans;
}
int main() {
  fastio();
  long long int T;
  T = 1;
  while (T--) {
    long long int i;
    cin >> n >> k;
    for (i = 0; i < n; i++) cin >> a[i];
    memset(dp, -1, sizeof(dp));
    int ans = solve(k, 0);
    if (ans == 1)
      cout << "First" << endl;
    else
      cout << "Second" << endl;
  }
  return 0;
}
