#include <bits/stdc++.h>
using namespace std;
const int N = 105, K = 1e5 + 5;
int n, k, dp[K], a[N];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> k;
  for (int i = 1; i <= n; ++i) cin >> a[i];
  sort(a + 1, a + n + 1);
  for (int i = a[1]; i <= K; ++i) {
    bool check = false;
    for (int j = 1; j <= n; ++j)
      if (i - a[j] >= 0 && dp[i - a[j]] == 0) check = true;
    if (check) dp[i] = 1;
  }
  if (dp[k])
    cout << "First\n";
  else
    cout << "Second\n";
  return 0;
}
