#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5;
int N, K;
int dp[MAXN];
int a[MAXN];
int solve(int k) {
  if (k == 0) return 0;
  if (dp[k] != -1) return dp[k];
  int ans = 0;
  for (int i = 1; i <= N; i++) {
    if (k >= a[i]) {
      if (solve(k - a[i]) == 0) ans = 1;
    }
  }
  return dp[k] = ans;
}
int main() {
  memset(dp, -1, sizeof(dp));
  cin >> N >> K;
  for (int i = 1; i <= N; i++) cin >> a[i];
  if (solve(K) == 1)
    cout << "First\n";
  else
    cout << "Second\n";
}
