#include <bits/stdc++.h>
using namespace std;
long long N, K;
long long a[101];
long long dp[123456];
long long solve(long long k) {
  if (dp[k] != 0) return dp[k];
  long long c = lower_bound(a, a + N, k) - a;
  if (a[c] == k) return 1;
  for (long long i = 0; i < c; i++) {
    if (solve(k - a[i]) == -1) return dp[k] = 1;
  }
  return dp[k] = -1;
}
signed main() {
  cin >> N >> K;
  for (long long i = 0; i < N; i++) {
    cin >> a[i];
  }
  solve(K);
  if (dp[K] == 1)
    cout << "First" << endl;
  else
    cout << "Second" << endl;
  return 0;
}
