#include <bits/stdc++.h>
using namespace std;
bool solve(int n, int k, int a[]) {
  bool dp[k + 1];
  for (int j = 0; j < k; j++) {
    for (int i = 0; i < n; i++) {
      if (j >= a[i] && !dp[j - a[i]]) dp[i] = true;
    }
  }
  return dp[k - 1];
}
int main() {
  int n, k;
  cin >> n >> k;
  int a[n];
  int sum = 0;
  for (int i = 0; i < n; i++) cin >> a[i];
  solve(n, k, a) ? cout << "First" << endl : cout << "Second" << endl;
  return 0;
}
