#include <bits/stdc++.h>
using namespace std;
int dp[100005];
int solve() {
  int n, k;
  cin >> n >> k;
  int a[n], i;
  for (i = 0; i < n; i++) {
    cin >> a[i];
  }
  dp[0] = 0;
  int j;
  for (i = 1; i <= k; i++) {
    dp[i] = 0;
    if (i < a[0]) {
      dp[i] = 0;
      continue;
    }
    if (i == a[0]) {
      dp[i] = 1;
      continue;
    }
    for (j = 0; j < n; j++) {
      if (a[j] > i) {
        break;
      }
      if (a[j] == k) {
        dp[i] = 1;
        break;
      }
      if (dp[i - a[j]] == 0) {
        dp[i] = 1;
      }
    }
  }
  if (dp[k])
    cout << "first\n";
  else
    cout << "second\n";
  return 0;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
