#include <bits/stdc++.h>
using namespace std;
int n, k;
int mn;
int a[100005], dp[100005];
int solve(int s) {
  if (s < mn)
    return -1;
  else if (dp[s])
    return dp[s];
  for (int i = 0; i < n; ++i) {
    int temp = solve(s - a[i]);
    if (temp == -1) {
      dp[s] = 1;
      return dp[s];
    } else if (temp == 1) {
      dp[s] = -1;
    }
  }
  return dp[s];
}
int main() {
  cin >> n >> k;
  cin >> a[0];
  mn = a[0];
  for (int i = 1; i < n; ++i) {
    cin >> a[i];
    mn = min(a[i], mn);
  }
  solve(k);
  if (dp[k] == 1)
    cout << "First\n";
  else if (dp[k] == -1)
    cout << "Second\n";
}
