#include <bits/stdc++.h>
using namespace std;
const long long N = 1e5 + 5;
long long n, k;
long long a[N], cache[N];
long long dp(long long cur) {
  long long ans = 0;
  for (long long i = 1; i <= n; i++) {
    if (cur - a[i] < 0) break;
    ans |= (dp(cur - a[i]) == 0);
  }
  return ans;
}
int32_t main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  memset(cache, -1, sizeof(cache));
  cin >> n >> k;
  for (long long i = 1; i <= n; i++) cin >> a[i];
  if (dp(k))
    cout << "First";
  else
    cout << "Second";
  return 0;
}
