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