#include <bits/stdc++.h>
using namespace std;
long long minx;
int n;
vector<long long> a;
int dp[1000001];
int solve(int rem) {
  if (dp[rem] != -1) return dp[rem];
  for (int i = 0; i < n; i++) {
    if (solve(rem - a[i]) == 0) {
      dp[rem] = 1;
      return 1;
    }
  }
  dp[rem] = 0;
  return dp[rem];
}
int main() {
  int k;
  cin >> n >> k;
  for (int i = 0; i < n; i++) {
    long long x;
    cin >> x;
    a.push_back(x);
  }
  minx = a[0];
  for (int i = 0; i < n; i++) {
    minx = min(a[i], minx);
  }
  for (int i = 0; i <= k; i++) {
    dp[i] = -1;
  }
  for (int i = 0; i < n; i++) {
    dp[a[i]] = 1;
  }
  for (int i = 0; i < minx; i++) {
    dp[i] = 0;
  }
  int x = solve(k);
  if (dp[k] == 0)
    cout << "Second";
  else
    cout << "First";
}
