#include <bits/stdc++.h>
using namespace std;
const long long mod = (long long)1e9 + 7;
const int MAX = (int)1e2 + 100;
const int oo = 0x3f3f3f3f;
int dp[100005];
int n, k, mn, a[MAX];
int Solve(int k) {
  if (dp[k] != -1) return dp[k];
  for (int i = 0; i < n; ++i) {
    if (k - a[i] < mn) return true;
    if (!Solve(k - a[i])) return dp[k] = true;
  }
  return dp[k] = 0;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> k;
  for (int i = 0; i < n; ++i) {
    cin >> a[i];
    if (i == 0)
      mn = a[i];
    else
      mn = min(mn, a[i]);
  }
  memset(dp, -1, sizeof(dp));
  if (Solve(k) == 1)
    cout << "First\n";
  else
    cout << "Second\n";
}
