#include <bits/stdc++.h>
using namespace std;
const int M = 1e9 + 7;
int n, k;
int f(int sum, int winner, vector<int> &v) {
  if (sum < 0) {
    return !(winner);
  }
  int temp = winner;
  for (int i = 0; i < n; i++) {
    int ans = f(sum - v[i], !(winner), v);
    if (ans != temp) {
      temp = !(winner);
      break;
    }
  }
  return temp;
}
int main() {
  int i, j, wt, m;
  cin >> n >> k;
  vector<int> v(n);
  for (i = 0; i < n; i++) cin >> v[i];
  (f(k, 0, v) == 0) ? (cout << "Second") : (cout << "First");
}
