#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
template <class T>
inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
const long long INF = 1LL << 60;
int main() {
  int n;
  ll k, mn = 100000, a[n];
  cin >> n >> k;
  for (int i = 0; i < n; ++i) {
    scanf("%d", &a[i]);
  }
  int dp[100005];
  memset(dp, 0, sizeof dp);
  for (int i = 0; i <= k; ++i) {
    for (int j = 0; j < n; ++j) {
      if (i >= a[j] && !dp[i - a[j]]) {
        dp[i] = 1;
        break;
      }
    }
  }
  if (dp[k])
    cout << "First";
  else
    cout << "Second";
  return 0;
}
