#include <bits/stdc++.h>
const long long mxn = 1e5 + 7;
const long long mod = 1e9 + 7;
const long long inf = 1e18 + 9;
using namespace std;
long long n, a[mxn], k, dp[mxn];
bool ok = 0;
int main() {
  cin >> n >> k;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
  }
  for (int i = 1; i <= k; i++) {
    for (int j = 1; j <= n; j++) {
      if (i == a[j]) {
        dp[i] = 1;
      }
    }
  }
  for (int i = 1; i <= k; i++) {
    ok = 0;
    for (int j = 1; j <= n; j++) {
      if (i >= a[j]) {
        if (dp[i - a[j]] != 1) {
          ok = 1;
        }
      }
    }
    if (ok == 1) {
      dp[i] = 1;
    } else {
      dp[i] = 0;
    }
  }
  if (dp[k] == 1) {
    cout << "first";
  } else {
    cout << "second";
  }
  return 0;
}
