#include <bits/stdc++.h>
using namespace std;
const int INF = 1001001001;
vector<long long> a(105);
long long dp[100005];
int n;
int dfs(int x) {
  if (dp[x] != -1) return dp[x];
  long long now = -1;
  for (long long i = 0; i < n; ++i) {
    if (x - a[i] < 0) continue;
    if (dfs(x - a[i]) == 0) now = 1;
  }
  if (now == 1)
    dp[x] = 1;
  else
    dp[x] = 0;
  return dp[x];
}
int main() {
  int k;
  cin >> n >> k;
  for (long long i = 0; i < n; ++i) {
    cin >> a[i];
  }
  for (long long i = 0; i < 105; ++i) dp[i] = -1;
  for (long long i = 0; i < a[0]; ++i) dp[i] = 0;
  long long ans = dfs(k);
  if (ans == 1)
    cout << "First";
  else
    cout << "Second";
  return 0;
}
