#include <bits/stdc++.h>
const int M = 998244353;
using namespace std;
const long long int mod = 1e9 + 7;
const long long int N = 2e2 + 7;
long long int n, k;
long long int a[N];
long long int dp[100010][2];
long long int s = 1e15 + 1;
long long int solve(long long int sum, long long int cha) {
  if (sum < s) {
    if (sum >= 0) dp[sum][cha] = cha;
    return cha;
  }
  if (dp[sum][cha] != -1) return dp[sum][cha];
  for (long long int i = 0; i < n; i++) {
    long long int x = solve(sum - a[i], (cha + 1) % 2);
    if (x == (cha + 1) % 2) {
      dp[sum][cha] = x;
      return x;
    }
  }
  dp[sum][cha] = cha;
  return cha;
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  cin >> n >> k;
  for (long long int i = 0; i < n; i++) {
    cin >> a[i];
    s = min(s, a[i]);
  }
  memset(dp, -1, sizeof(dp));
  long long int x = solve(k, 0);
  if (x == 0)
    cout << "Second";
  else
    cout << "First";
}
