#include <bits/stdc++.h>
using namespace std;
;
int dp[100002];
bool solve(int k, int a[], int n) {
  if (k == 0) return 0;
  if (dp[k] != -1) return dp[k];
  int ans = 0;
  for (int i = 0; i < n; i++) {
    if (k >= a[i] && solve(k - a[i], a, n) == 0) {
      ans = 1;
      break;
    }
  }
  dp[k] = ans;
  return dp[k];
}
int main() {
  int n, k;
  cin >> n >> k;
  int a[n];
  for (int i = 0; i < n; i++) cin >> a[i];
  memset(dp, -1, sizeof(dp));
  if (solve(k, a, n))
    cout << "First";
  else
    cout << "Second";
}
