#include <bits/stdc++.h>
#pragma gcc optimize("Ofast")
using namespace std;
int n, k;
int dp[100005];
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cin >> n >> k;
  int a[n];
  for (int i = 0; i < n; i++) cin >> a[i];
  for (int i = a[0]; i <= k; i++) {
    for (int j = 0; a[j] <= i; j++) {
      if (dp[i - a[j]] == 0) dp[i] = 1;
    }
  }
  if (dp[k] == 1)
    cout << "First" << endl;
  else
    cout << "Second" << endl;
}
