#include <bits/stdc++.h>
using namespace std;
int n, k;
vector<int> v;
int dp[100001];
int solve(int i) {
  int &ret = dp[i];
  if (ret != -1) return ret;
  if (i < v[0]) return ret = 0;
  ret = 0;
  for (int j = 0; j < n; j++) {
    if (solve(i - v[j]) == 0) ret = 1;
  }
  return ret;
}
int main() {
  cin >> n >> k;
  for (int i = 0; i < n; i++) {
    int x;
    scanf("%d", &x);
    v.push_back(x);
  }
  memset(dp, -1, sizeof(dp));
  if (solve(k) == 1)
    cout << "First";
  else
    cout << "Second";
  return 0;
}
