#include <bits/stdc++.h>
using namespace std;
void solve() {
  long long n, k;
  cin >> n >> k;
  long long arr[n];
  for (long long i = 0; i < n; ++i) cin >> arr[i];
  vector<vector<bool>> dp(n + 1, vector<bool>(k + 1, 0));
  for (long long i = 1; i < n + 1; ++i) {
    for (long long j = 1; j < k + 1; ++j) {
      if (arr[i - 1] <= j)
        dp[i][j] = (dp[i - 1][j] || !dp[i][j - arr[i - 1]]);
      else
        dp[i][j] = dp[i - 1][j];
    }
  }
  cout << (dp[n][k] ? "First\n" : "Second\n");
}
int main() {
  std::ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int T = 1;
  while (T--) solve();
  return 0;
}
