#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <typename T>
using ve = vector<T>;
template <typename T>
using pq2 = priority_queue<T>;
template <typename T>
using pq1 = priority_queue<T, vector<T>, greater<T>>;
template <typename T>
bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <typename T>
bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
int main() {
  int N, K;
  cin >> N >> K;
  vi a(N);
  for (int i = 0; i < (N); i++) {
    cin >> a[i];
  };
  vvi dp(N + 1, vi(K + 1, 1900000000));
  dp[0][0] = 0;
  for (int i = 0; i < (N); i++) {
    for (int j = 0; j < (K + 1); j++) {
      chmin(dp[i + 1][j], dp[i][j]);
      if (j + a[i] <= K && dp[i + 1][j] != 1900000000)
        chmin(dp[i + 1][j + a[i]], dp[i + 1][j] + 1);
      else if (j + a[i] > K)
        chmin(dp[i + 1][K], dp[i][j]);
    }
  }
  if (dp[N][K] % 2 == 1)
    cout << "First" << endl;
  else
    cout << "Second" << endl;
  return 0;
}
