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