#include <bits/stdc++.h>
using namespace std;
bool isPrime(long long n) {
  if (n <= 1) return false;
  if (n <= 3) return true;
  if (n % 2 == 0 || n % 3 == 0) return false;
  for (int i = 5; i * i <= n; i = i + 6)
    if (n % i == 0 || n % (i + 2) == 0) return false;
  return true;
}
long long int gcd(long long int a, long long int b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
long long int lcm(long long int a, long long int b) {
  long long int x = a * b;
  return (x / gcd(a, b));
}
long long int logint(long long int a, long long int b) {
  long long int i = 0;
  long long int k = 1;
  while (a > k) {
    i++;
    k = pow(b, i);
  }
  return i - 1;
}
void printDivisors(long long int n, vector<long long int> &v1) {
  for (int i = 1; i <= sqrt(n); i++) {
    if (n % i == 0) {
      if (n / i == i) {
        v1.push_back(i);
      } else {
        v1.push_back(i);
        v1.push_back(n / i);
      }
    }
  }
}
void solve() {
  long long int n, k;
  cin >> n >> k;
  long long int a[n];
  for (long long int i = 0; i < n; i++) cin >> a[i];
  vector<int> dp(k + 1, -1);
  for (int i = 1; i <= k; i++) {
    if (binary_search(a, a + n, i)) {
      dp[i] = 1;
    } else {
      for (int j = 0; j < n; j++) {
        if (dp[i - a[j]] == 0) {
          dp[i] = 1;
          break;
        }
      }
      if (dp[i] == -1) dp[i] = 0;
    }
  }
  if (dp[k])
    cout << "First"
         << "\n";
  else
    cout << "Second"
         << "\n";
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  { solve(); }
}
