#include <bits/stdc++.h>
using namespace std;
int a[1000], dp[100009][3], n, k;
int sol(int x, int tu) {
  if (dp[x][tu] != -1) return dp[x][tu];
  if (tu == 2)
    dp[x][tu] = 1;
  else
    dp[x][tu] = 0;
  for (int i = 0; a[i] <= x && i < n; i++) {
    if (tu == 1)
      dp[x][tu] = max(sol(x - a[i], 2), dp[x][tu]);
    else
      dp[x][tu] = min(sol(x - a[i], 1), dp[x][tu]);
  }
  return dp[x][tu];
}
int main() {
  cin >> n >> k;
  memset(dp, -1, sizeof(dp));
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  sort(a, a + n);
  int ans = sol(k, 1);
  if (ans == 0)
    cout << "Second";
  else
    cout << "first";
  return 0;
}
