#include <bits/stdc++.h>
using namespace std;
int n, k, mn;
int dp[200005];
int dizi[302];
int dpf(int tas) {
  if (tas < mn) {
    return 0;
  }
  if (dp[tas] != -1) return dp[tas];
  int mx = 1;
  for (int i = 0; i < n; i++) {
    if ((tas - dizi[i]) < mn) {
      mx = 0;
      break;
    }
    mx = min(dpf(tas - dizi[i]), mx);
  }
  mx = !mx;
  dp[tas] = mx;
  return dp[tas];
}
int main() {
  for (int i = 0; i < 100005; i++) {
    dp[i] = -1;
  }
  mn = INT_MAX;
  scanf("%d %d", &n, &k);
  for (int i = 0; i < n; i++) {
    scanf("%d", &dizi[i]);
    mn = min(mn, dizi[i]);
  }
  if (dpf(k)) {
    printf("First\n");
  } else
    printf("Second\n");
}
