#include <bits/stdc++.h>
using ll = long long;
static const ll mod = 1e9 + 7;
static const ll INF = 1LL << 50;
using namespace std;
int dp[100005];
int main() {
  int n, k;
  memset(dp, 0, sizeof(dp));
  cin >> n >> k;
  vector<int> a(n);
  for (int i = (int)0; i < (int)n; ++i) cin >> a[i];
  for (int i = 1; i <= n; ++i) {
    for (int j = (int)0; j < (int)n; ++j) {
      if (i >= a[j] && dp[i - a[j]] == 0) dp[i] = 1;
    }
  }
  if (dp[k])
    cout << "First" << endl;
  else
    cout << "Second" << endl;
  return 0;
}
