#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
long long lcm(long long a, long long b) { return a * (b / gcd(a, b)); }
long long n, k;
long long a[101];
long long dp[100001][2];
long long solve(long long sum, long long p) {
  if (sum < a[0] && p == 1) return -1;
  if (sum < a[0] && p == 0) return 1;
  if (dp[sum][p] != 0) return dp[sum][p];
  if (p) {
    dp[sum][p] = -1;
    for (int i = 0; i < n; i++) {
      dp[sum][p] = max(dp[sum][p], solve(sum - a[i], (p + 1) % 2));
    }
  }
  if (!p) {
    dp[sum][p] = 1;
    for (int i = 0; i < n; i++) {
      dp[sum][p] = min(dp[sum][p], solve(sum - a[i], (p + 1) % 2));
    }
  }
  return dp[sum][p];
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> k;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  if (n == 1) {
    if (k % a[0] == 0)
      cout << "Second";
    else
      cout << "First";
    return 0;
  }
  memset(dp, 0, sizeof(dp));
  if (solve(k, 0) < 1)
    cout << "First";
  else
    cout << "Second";
}
