#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
void solve() {
  int n, k = 1, m = 0, i = 1, j, x, y, l, r, p, q, z;
  int ans = 0, a[105]{};
  cin >> n >> k;
  for (i = 0; i < n; i++) cin >> a[i];
  set<int> b1, b2;
  for (i = 0; i < a[0]; i++) b2.insert(i);
  while (*b2.begin() < k) {
    for (int sec : b2) {
      for (i = 0; i < n; i++) b1.insert(sec + a[i]);
    }
    b2.clear();
    if (b1.count(k)) {
      cout << "First";
      return;
    }
    if (*b1.begin() > k) break;
    for (int sec : b1) {
      for (i = 0; i < n; i++) b2.insert(sec + a[i]);
    }
    b1.clear();
  }
  cout << "Second";
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  int t = 1;
  while (t--) solve();
  return 0;
}
