#include <bits/stdc++.h>
#pragma GCC optimize "trapv"
using namespace std;
const int N = 1e+5;
long long int power(long long int x, long long int y, long long int p) {
  long long int res = 1;
  x = x % p;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res % p;
}
long long int modInverse(long long int n, long long int p) {
  return power(n, p - 2, p);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ;
  int dp[N];
  int n, k;
  vector<int> a(n);
  cin >> n >> k;
  for (int& x : a) cin >> x;
  dp[0] = 0;
  for (int i = 1; i <= k; i++) {
    for (int x : a) {
      dp[i] = 0;
      if (i >= x && dp[i - x] == 0) {
        dp[i] = 1;
        break;
      }
    }
  }
  if (dp[k] == 1)
    cout << "First";
  else
    cout << "Second";
}
