#include <bits/stdc++.h>
using namespace std;
long long MOD = 1e9 + 7;
bool dp[100001];
int a[100];
int main() {
  int n, k;
  int ans = 0;
  cin >> n >> k;
  for (int i = 0; i < n; i++) cin >> a[i];
  fill(dp, dp + 100001, false);
  for (int i = 0; i < a[0]; i++) dp[i] = false;
  for (int i = a[0]; i < a[n - 1] + a[0]; i++) dp[i] = true;
  for (int i = a[n - 1] + a[0]; i < k + 1; i++) {
    bool f = false;
    for (int j = 0; j < n; j++) {
      if (!dp[i - a[j]]) {
        f = true;
        break;
      }
    }
    dp[i] = f;
  }
  if (dp[k])
    cout << "First" << endl;
  else
    cout << "Second" << endl;
  return 0;
}
