#include <bits/stdc++.h>
using namespace std;
long long mod = 1e9 + 7;
void solve_2() {
  int n, k, x;
  cin >> n >> k;
  int a[n];
  vector<bool> dp(k + 1, false);
  for (int i = 0; i < n; i++) {
    cin >> x;
    for (int stones = 0; stones <= k - x; stones++) {
      dp[stones + x] = dp[stones + x] || !dp[stones];
    }
  }
  cout << (dp[k] ? "First" : "Second");
}
void solve() {
  int n, k;
  cin >> n >> k;
  int a[n];
  for (int i = 0; i < n; i++) cin >> a[i];
  vector<bool> dp(k + 1);
  for (int stones = 0; stones <= k; ++stones) {
    for (auto x : a) {
      if (stones >= x && !dp[stones - x]) {
        dp[stones] = true;
      }
    }
  }
  cout << (dp[k] ? "First" : "Second");
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long t = 1;
  while (t--) {
    solve_2();
  }
  return 0;
}
