#include <bits/stdc++.h>
using namespace std;
long long n, k;
long long a[110];
long long dp[100010][2];
long long solve(long long st, long long t) {
  if (st < a[1] && (t == 1)) return 0;
  if (st < a[1] && (t == 0)) return 1;
  if (dp[st][t] != -1) return dp[st][t];
  long long ans = 0;
  for (long long i = 1; i <= n; i++) {
    if (st >= a[i]) ans = ans | solve(st - a[i], !t);
  }
  return dp[st][t] = ans;
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  memset(dp, -1, sizeof(dp));
  cin >> n >> k;
  for (long long i = 1; i <= n; i++) cin >> a[i];
  long long ans = solve(k, 1);
  if (ans)
    cout << "First\n";
  else
    cout << "Second\n";
  return 0;
}
