#include <bits/stdc++.h>
using namespace std;
long long n, m;
bool dp[100005];
string solve(vector<long long>& v, long long k) {
  for (int i = 1; i <= k; i++) {
    for (long long move : v) {
      if (move > i) continue;
      if (dp[i - move] == 0) dp[i] = 1;
    }
  }
  return dp[k] ? "First" : "Second";
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long c, d, e, f = 0, sum = 0, ck, k, p, q, r, t, add = 0, w, x, y, z;
  string ans;
  cin >> n >> k;
  memset(dp, -1, sizeof dp);
  vector<long long> v(n);
  for (int i = 0; i < n; i++) {
    cin >> v[i];
  }
  ans = solve(v, k);
  cout << ans << endl;
  return 0;
}
