#include <bits/stdc++.h>
using namespace std;
void solve();
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0);
  int t;
  t = 1;
  while (t--) solve();
  return 0;
}
int dp[105];
int n, k, a[100005];
bool dfs(int balance) {
  if (dp[balance] != -1) return dp[balance];
  int ans = 0;
  for (int i = 1; i <= n; ++i)
    if (a[i] <= balance) ans |= !dfs(balance - a[i]);
  return dp[balance] = ans;
}
void solve() {
  cin >> n >> k;
  memset(dp, -1, sizeof(dp));
  for (int i = 1; i <= n; ++i) cin >> a[i];
  cout << (dfs(k) ? "First\n" : "Second\n");
}
