#include <bits/stdc++.h>
using namespace std;
long long n, k, v[100009], pd[100009], pd2[100009], ans[4][100009];
long long solve() {
  pd2[k] = 1;
  for (long long i = k; i >= 0; --i) {
    if (pd2[i]) {
      long long cate = 0;
      for (long long j = 1; j <= n; ++j) {
        if (i - v[j] < 0)
          cate++;
        else
          pd[i - v[j]] = pd2[i] + 1;
      }
      if (cate == n) ans[2][i] = pd2[i];
    }
    if (pd[i]) {
      long long cate = 0;
      for (long long j = 1; j <= n; ++j) {
        if (pd[i]) {
          if (i - v[j] < 0)
            cate++;
          else
            pd2[i - v[j]] = pd[i] + 1;
        }
      }
      if (cate == n) ans[1][i] = pd[i];
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false), cin.tie(NULL);
  cin >> n >> k;
  for (long long i = 1; i <= n; ++i) cin >> v[i];
  sort(v + 1, v + n + 1);
  solve();
  for (long long i = k; i >= 0; --i) {
    if (ans[1][i] < ans[2][i]) {
      cout << "Second";
      return 0;
    }
    if (ans[1][i] > ans[2][i]) {
      cout << "First";
      return 0;
    }
  }
  cout << "Second";
  return 0;
}
