#include <bits/stdc++.h>
using namespace std;
void dm(vector<vector<long long> >& m) {
  for (long long i = 0; i < m.size(); i++) {
    for (long long j = 0; j < m[i].size(); j++) {
      if (j != m[i].size() - 1) {
        cout << m[i][j] << " ";
      } else {
        cout << m[i][j] << endl;
      }
    }
  }
}
void dv(vector<long long>& v) {
  for (long long i = 0; i < v.size() - 1; i++) {
    cout << v[i] << " ";
  }
  cout << v[v.size() - 1] << endl;
}
void swap(long long& a, long long& b) {
  long long temp = a;
  a = b;
  b = temp;
}
long long minval(long long a, long long b) {
  if (a < b) {
    return a;
  }
  return b;
}
long long maxval(long long a, long long b) {
  if (a > b) {
    return a;
  }
  return b;
}
long long gcd(long long a, long long b) {
  if (b == 0) {
    return a;
  }
  return gcd(b, a % b);
}
long long powmod(long long a, long long b, long long mod) {
  if (b == 0) return 1;
  if (b % 2 == 0) {
    long long c = powmod(a, b / 2, mod);
    return (c * c) % mod;
  } else {
    return (a * powmod(a, b - 1, mod)) % mod;
  }
}
long long modInverse(long long A, long long M) { return powmod(A, M - 2, M); }
void solve() {}
bool winner(long long k, vector<long long>& v, vector<long long>& dp,
            long long level) {
  if (k == 0) {
    return false;
  }
  if (dp[k] == 1) {
    return true;
  }
  if (dp[k] == 0) {
    return false;
  }
  bool wins = false;
  for (long long i = 0; i < v.size(); i++) {
    if (v[i] <= k) {
      wins = (wins || (!winner(k - v[i], v, dp, level + 1)));
    }
    if (wins) {
      dp[k] = 1;
      return true;
    }
  }
  dp[k] = 0;
  return false;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long n, k;
  cin >> n >> k;
  vector<long long> v(n);
  for (long long i = 0; i < n; i++) {
    cin >> v[i];
  }
  vector<long long> dp(k + 1, -1);
  if (winner(k, v, dp, 0)) {
    cout << "First" << endl;
  } else {
    cout << "Second" << endl;
  }
  return 0;
}
