#include <bits/stdc++.h>
using namespace std;
const int maxn = 110;
int n, k;
int a[maxn], dp[maxn][2];
bool dfs(int x, int y) {
  if (dp[x][y] >= 0) return dp[x][y];
  int ans = 0;
  for (int i = 1; i <= n; i++) {
    if (x >= a[i]) ans |= !dfs(x - a[i], !y);
  }
  return dp[x][y] = ans;
}
signed main() {
  memset(dp, -1, sizeof dp);
  cin >> n >> k;
  for (int i = 1; i <= n; i++) cin >> a[i];
  if (dfs(k, 0))
    cout << "First" << endl;
  else
    cout << "Second" << endl;
  return 0;
}
