#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
int const MAXN = 110, MAXK = 110000;
int n, k, v[MAXN];
bool dp[MAXN];
int main() {
  cin >> n >> k;
  for (int i = 0; i < n; i++) cin >> v[i];
  for (int i = 1; i <= k; i++) {
    bool possible = false;
    for (int j = 0; j < n && i - v[j] >= 0 && !dp[i]; j++)
      if (!dp[i - v[j]]) dp[i] = true;
  }
  cout << (dp[k] ? "First" : "Second");
}
