#include <bits/stdc++.h>
using namespace std;
long long int n, k, a[1000], dp[1000009];
int main() {
  memset(dp, 0, sizeof(dp));
  cin >> n >> k;
  for (int i = 1; i <= n; i++) cin >> a[i];
  for (int i = 1; i <= k; i++) {
    for (int j = 1; j <= n; j++) {
      if (i - a[j] >= 0) {
        dp[i] = 1 - (dp[i - a[j]]);
      }
    }
  }
  if (dp[k])
    cout << "First" << endl;
  else
    cout << "Second" << endl;
  return 0;
}
