#include <bits/stdc++.h>
using namespace std;
const long long int inf = 1e18, M = 1e9 + 7;
const long long int N = 1e5 + 10;
long long int dp[N];
vector<long long int> v;
long long int n;
void solve() {
  memset(dp, 1, sizeof(dp));
  long long int k;
  cin >> n >> k;
  v.resize(n);
  for (long long int i = 0; i < n; ++i) cin >> v[i];
  for (long long int i = 0; i < v[0]; ++i) dp[i] = 0;
  for (long long int i = v[0]; i <= k; ++i) {
    for (auto c : v) {
      if (i - c < 0) {
        dp[i] = 0;
        break;
      }
      dp[i] &= dp[i - c];
    }
    dp[i] ^= 1;
  }
  if (dp[k])
    cout << "First";
  else
    cout << "Second";
}
int32_t main() {
  long long int t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
