#include <bits/stdc++.h>
using namespace std;
long long n, k;
long long dp[100005];
long long solve(long long *a) {
  for (long long i = a[0]; i <= k; i++) {
    long long j = 0;
    for (; (i - j) >= 0 && j < n; j++) {
      if (dp[i - a[j]] == 0) {
        dp[i] = 1;
        break;
      }
    }
    if (j == n) dp[i] = 0;
  }
  return dp[k];
}
int32_t main() {
  cin >> n >> k;
  memset(dp, -1, sizeof(dp));
  long long a[n];
  for (long long i = 0; i < n; i++) {
    cin >> a[i];
  }
  sort(a, a + n);
  for (long long i = 0; i < a[0]; i++) {
    dp[i] = 0;
  }
  if (solve(a) == 1)
    cout << "First";
  else
    cout << "Second";
}
