#include <bits/stdc++.h>
using namespace std;
int a[105], n, k, mik, dp[10000005];
int fun(int k) {
  if (k < mik) return 1;
  for (int i = 0; i < n; ++i)
    if (k - a[i] >= 0) {
      if (dp[k - a[i]] == -1) {
        dp[k - a[i]] = fun(k - a[i]);
      }
      if (dp[k - a[i]] == 2) return 1;
    }
  return 2;
}
int main() {
  int i;
  cin >> n >> k;
  for (i = 0; i < 10000005; ++i) dp[i] = -1;
  for (i = 0; i < n; ++i) {
    cin >> a[i];
    mik = min(mik, a[i]);
    dp[a[i]] = 1;
  }
  int val = fun(k);
  if (val == 1)
    cout << "first";
  else
    cout << "second";
  return 0;
}
