#include <bits/stdc++.h>
using namespace std;
int dp[1000009], arr[109];
int main() {
  memset(dp, 0, sizeof(dp));
  int n, k;
  cin >> n >> k;
  for (int i = 0; i < n; i++) cin >> arr[i];
  sort(arr, arr + n);
  for (int i = 1; i <= n; i++) dp[arr[i]] = 1;
  dp[0] = 0;
  for (int i = 1; i <= k; i++) {
    for (int j = 0; j < n; j++) {
      if (i >= arr[j]) {
        if (!dp[i - arr[j]]) dp[i] = 1;
      }
    }
  }
  if (dp[k] == 1)
    cout << "first\n";
  else
    cout << "Second" << endl;
}
