#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
long int n, k, a[107], dp[100007];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  ;
  cin >> n >> k;
  for (long int i = 0; i < n; i++) cin >> a[i];
  sort(a, a + n);
  for (long int i = 0; i <= a[0]; i++) dp[i] = 1;
  for (long int i = 0; i <= k; i++) {
    if (!dp[i]) dp[i] = 1;
    if (dp[i] == 1)
      for (long int j = 0; j < n; j++) {
        dp[i + a[j]] = 2;
      }
  }
  if (dp[k] == 2)
    cout << "First";
  else
    cout << "Second";
}
