#include <bits/stdc++.h>
using namespace std;
int n, K;
vector<int> v;
int dp[100005];
int solve(int k) {
  if (k > K) return 0;
  if (k == K) return 1;
  if (dp[k] != -1) return dp[k];
  for (int &a : v) {
    if (solve(k + a)) return dp[k] = 0;
  }
  return dp[k] = 1;
}
int main() {
  cin >> n >> K;
  v.resize(n);
  for (int &a : v) cin >> a;
  memset(dp, -1, sizeof(dp));
  cout << (solve(0) ? "Second" : "First");
}
