#include <bits/stdc++.h>
long min(long a, long b) {
  if (a < b)
    return a;
  else
    return b;
}
int main(void) {
  int n, k, a[105];
  int dp[10005] = {0};
  int h = 0;
  scanf("%d%d", &n, &k);
  for (int i = 0; i < n; i++) scanf("%d", &a[i]);
  for (int i = 0; i <= k; i++) {
    for (int j = 0; j < n; j++) {
      if (i >= a[j]) {
        if (dp[i - a[j]] == 0) dp[i] = 1;
      }
    }
  }
  if (dp[k] == 1)
    printf("First\n");
  else
    printf("Second\n");
  return 0;
}
