#include <bits/stdc++.h>
using namespace std;
int dp[300001];
int ar[300001];
int i, j, k, l, m, n;
int solve(int x) {
  if (dp[x] != -1) return dp[x];
  if (x == 0) return 0;
  int ans = 0;
  for (i = 0; i < n; i++) {
    if (ar[i] > x) continue;
    if (solve(x - ar[i]) == 0) {
      ans = 1;
      break;
    }
  }
  return dp[x] = ans;
}
int main() {
  cin >> n >> k;
  memset(dp, -1, sizeof dp);
  for (i = 0; i < n; i++) cin >> ar[i];
  if (solve(k))
    cout << "First" << endl;
  else
    cout << "Second" << endl;
}
