#include <bits/stdc++.h>
using namespace std;
long long gcd(long long x, long long y) {
  if (x == 0) return y;
  return gcd(y % x, x);
}
long long powmod(long long x, long long y, long long m) {
  if (y == 0) return 1;
  long long p = powmod(x, y / 2, m) % m;
  p = (p * p) % m;
  return (y % 2 == 0) ? p : (x * p) % m;
}
long long modif(long long x, long long m) { return (powmod(x, m - 2, m)); }
bool fa(vector<long long> &x, vector<long long> &y) { return x[0] < y[0]; }
bool fa1(vector<long long> &x, vector<long long> &y) { return x[1] < y[1]; }
bool f1(pair<long long, long long> &x, pair<long long, long long> &y) {
  return x.second < y.second;
}
bool f2(pair<long long, long long> &x, pair<long long, long long> &y) {
  return x.first > y.first;
}
bool f3(long long &x, long long &y) { return x > y; }
long long dp[3001][3001];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long n, k;
  cin >> n >> k;
  long long b[n];
  for (int i = 0; i < n; i++) cin >> b[i];
  long long dp[k + 2];
  for (int i = 0; i < k + 2; i++) dp[i] = 0;
  dp[0] = -1;
  for (int i = 1; i < k + 2; i++) {
    long long ch = 0;
    for (auto x : b) {
      long long y = i - x;
      if (x < 0) continue;
      if (dp[y] == -1) {
        ch++;
        break;
      }
    }
    if (ch == 0) {
      dp[i] = -1;
    } else {
      dp[i] = 1;
    }
  }
  if (dp[k] == 1) {
    cout << "First";
  } else
    cout << "Second";
  return 0;
}
