#include <bits/stdc++.h>
using namespace std;
vector<long long int> a;
vector<long long int> ans(100005);
bool isPrime(long long int n) {
  if (n <= 1) return false;
  if (n <= 3) return true;
  if (n % 2 == 0 || n % 3 == 0) return false;
  for (long long int i = 5; i * i <= n; i = i + 6)
    if (n % i == 0 || n % (i + 2) == 0) return false;
  return true;
}
int main() {
  ios::sync_with_stdio(false);
  long long int i, j, k, l, m, n;
  cin >> n >> k;
  for (i = 0; i < n; i++) {
    cin >> j;
    a.push_back(j);
  }
  ans[0] = 1;
  if (a[0] <= 1) {
    ans[1] = 0;
  } else {
    ans[1] = 1;
  }
  for (i = 2; i <= k; i++) {
    for (j = 0; j < n; j++) {
      if (a[j] <= i) {
        if (ans[i - a[j]] == 1)
          ans[i] = 0;
        else
          ans[i] = 1;
        if (ans[i] == 0) {
          break;
        }
      }
    }
  }
  if (ans[k] == 1)
    cout << "Second\n";
  else
    cout << "First\n";
}
