#include <bits/stdc++.h>
using namespace std;
const long long int N = 100005;
const long long int mod = 1e9 + 7;
vector<long long int> stones(N);
long long int recur(long long int n, long long int k) {
  long long int dp[N];
  memset(dp, -1, sizeof(dp));
  dp[0] = 0;
  for (long long int i = 1; i <= k; i++) {
    bool flag = false;
    for (long long int j = 0; j < n; j++) {
      if (i - stones[j] >= 0) {
        if (dp[i - stones[j]] == 0) {
          flag = true;
          break;
        }
      }
    }
    if (flag)
      dp[i] = 1;
    else
      dp[i] = 0;
  }
  if (dp[k] == 1)
    cout << "First" << endl;
  else
    cout << "Second" << endl;
}
void solve() {
  long long int n, k;
  cin >> n >> k;
  for (long long int i = 0; i < n; i++) cin >> stones[i];
  recur(n, k);
}
void init() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
}
int32_t main() {
  init();
  solve();
}
