#include <bits/stdc++.h>
using namespace std;
int n;
int dp[100001];
int a[100001];
int getans(int curr) {
  if (dp[curr] != -1) return dp[curr];
  int flag = 0;
  for (int i = 0; i < n; i++) {
    if (a[i] <= curr) {
      if (getans(curr - a[i]) == 0) flag = 1;
    }
  }
  return flag;
}
void solve() {
  cin >> n;
  int k;
  cin >> k;
  for (int i = 0; i < n; i++) cin >> a[i];
  for (int i = 0; i < k + 1; i++) dp[i] = -1;
  dp[0] = 0;
  if (getans(k))
    cout << "First";
  else
    cout << "Second";
  cout << endl;
}
int main() {
  ios_base::sync_with_stdio(false);
  ;
  cin.tie(NULL);
  int zz;
  zz = 1;
  for (int zzz = 1; zzz <= zz; zzz++) {
    solve();
  }
  return 0;
}
