#include <bits/stdc++.h>
using namespace std;
int memo[100003];
int arr[101], n;
int rek(int x) {
  if (x < 0) return 1;
  if (x < arr[0]) return 0;
  if (memo[x] != -1) return memo[x];
  int tr = 0;
  for (int i = 0; i < n; i++) {
    if (rek(x - arr[i]) == 0) tr = 1;
  }
  return memo[x] = tr;
}
int main() {
  int k;
  cin >> n >> k;
  for (int i = 0; i < n; i++) {
    cin >> arr[i];
  }
  memset(memo, -1, sizeof memo);
  if (rek(k))
    cout << "first";
  else
    cout << "second";
  return 0;
}
