#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 15;
int n, k;
int a[N], dp[N];
int dmtr;
int solve(int k) {
  if (!k) return 0;
  if (dp[k] != -1) return dp[k];
  int res = 0;
  for (int i = 0; i < n; i++) {
    if (a[i] > k) continue;
    if (!solve(k - a[i])) res = 1;
  }
  dp[k] = res;
  return res;
}
int main() {
  memset(dp, -1, sizeof(dp));
  ios::sync_with_stdio(false);
  cin >> n >> k;
  for (int i = 0; i < n; i++) cin >> a[i];
  if (solve(k))
    cout << "first" << endl;
  else
    cout << "second" << endl;
}
