#include <bits/stdc++.h>
using namespace std;
int n, k;
int PD[100005][2];
bool visited[100005][2] = {false};
int stones[100004];
int pd(int i, int p) {
  if (i == 0) {
    return p == 1 ? 0 : 1;
  }
  int &ans = PD[i][p];
  if (visited[i][p]) {
    return ans;
  }
  int nextP = p == 1 ? 0 : 1;
  ans = nextP;
  for (int j = 0; j < n; j++) {
    if (i < stones[j]) {
      continue;
    }
    if (p == 1) {
      ans = max(ans, pd(i - stones[j], nextP));
    } else {
      ans = min(ans, pd(i - stones[j], nextP));
    }
  }
  visited[i][p] == true;
  return ans;
}
int main() {
  scanf("%d%d", &n, &k);
  for (int i = 0; i < n; i++) {
    scanf("%d", stones + i);
  }
  bool ans = pd(k, 0);
  printf("%s\n", !ans ? "First" : "Second");
  return 0;
}
