#include <bits/stdc++.h>
using namespace std;
const int N = 102, K = 100005;
int dp[K], a[N];
int n;
bool cal(int y) {
  if (y < a[0]) return 0;
  int &ret = dp[y];
  if (ret != -1) return ret;
  ret = 0;
  for (int i = 0; i < n; i++) {
    if (cal(y - a[i]) == 0) {
      ret = 1;
    }
  }
  return ret;
}
int main() {
  memset(dp, -1, sizeof(dp));
  int k;
  scanf("%d %d", &n, &k);
  for (int i = 0; i < n; i++) {
    scanf("%d", &a[i]);
  }
  printf(cal(k) ? "First" : "Second");
  return 0;
}
