#include <bits/stdc++.h>
using namespace std;
int n, k, a[107];
bool dp[100007], vis[100007];
bool solve(int rem) {
  if (vis[rem]) return dp[rem];
  bool ret = false;
  for (int i = 1; i <= n; i++) {
    if (a[i] > rem) continue;
    ret = max((int)ret, solve(rem - a[i]) ^ 1);
  }
  dp[rem] = ret;
  return ret;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> k;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
  }
  cout << (solve(k) ? "First" : "Second");
}
