#include <bits/stdc++.h>
using namespace std;
int N, K;
int DP[10001], A[101];
int solve(int stone) {
  if (DP[stone] >= 0) {
    return DP[stone];
  }
  int ret = 0;
  for (int i = 0; i < N; i++) {
    if (stone - A[i] >= 0) ret |= !(solve(stone - A[i]));
  }
  return DP[stone] = ret;
}
void reset() {
  for (int i = 0; i < 10001; i++) DP[i] = -1;
}
int main() {
  cin >> N >> K;
  reset();
  for (int i = 0; i < N; i++) {
    cin >> A[i];
  }
  if (solve(K)) {
    cout << "First"
         << "\n";
  } else {
    cout << "Second\n";
  }
  return 0;
}
