#include <bits/stdc++.h>
using namespace std;
using namespace std;
int dp[100000 + 5];
int solve(int k, int n, int a[]) {
  if (dp[k] != -1) return dp[k];
  int val2 = 1;
  for (int i = 0; i < n; i++) {
    if (k - a[i] > 0) {
      int val = solve(k - a[i], n, a);
      val2 = val2 & val;
    }
  }
  if (val2)
    return 0;
  else
    return 1;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ;
  int n, k, i;
  cin >> n >> k;
  int a[n];
  for (i = 0; i < n; i++) cin >> a[i];
  memset(dp, -1, sizeof(dp));
  for (i = 0; i < n; i++) dp[a[i]] = 1;
  if (solve(k, n, a) == 1)
    cout << "First";
  else
    cout << "Second";
}
