#include <bits/stdc++.h>
using namespace std;
int dp[110][2];
int n;
int a[110];
int f(int k, bool turn) {
  if (k == 0) return 0;
  if (dp[k][turn] != -1) return dp[k][turn];
  int ans = 0;
  for (int i = 0; i < n; i++) {
    if (k - a[i] < 0)
      break;
    else
      dp[k][turn] = ans |= !f(k - a[i], !turn);
  }
  return ans;
}
int main() {
  ;
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  int k;
  cin >> n >> k;
  for (int i = 0; i < n; i++) cin >> a[i];
  memset(dp, -1, sizeof dp);
  if (f(k, 0))
    cout << "First";
  else
    cout << "Second";
}
