#include <bits/stdc++.h>
using namespace std;
long long int n, k;
vector<long long int> v(102);
long long int dp[100002];
long long int fun(long long int left) {
  if (left == 0) {
    return 0;
  }
  if (left < 0) {
    return 1;
  }
  if (dp[left] != -1) {
    return dp[left];
  }
  for (long long int i = 0; i < n; ++i) {
    dp[left] |= (fun(left - v[i]) == 0);
  }
  return dp[left];
}
int32_t main() {
  scanf("%lld", &n);
  scanf("%lld", &k);
  for (long long int i = 0; i < n; ++i) {
    scanf("%lld", &v[i]);
  }
  for (long long int i = 0; i < 100002; ++i) {
    dp[i] = -1;
  }
  long long int ans = fun(k);
  if (ans) {
    printf("First");
  } else {
    printf("Second");
  }
  return 0;
}
