#include <bits/stdc++.h>
using namespace std;
void solve(int ar[], int n, int k) {
  int dp[k + 1];
  dp[0] = 0;
  for (int i = 1; i <= k; i++) {
    int c = 1;
    for (int j = 1; j <= n; j++) {
      if (i >= ar[j]) {
        if (dp[i - ar[j]] == 0) {
          c = 0;
          break;
        }
      }
    }
    if (c == 0) {
      dp[i] = 1;
    } else
      dp[i] = 0;
  }
  if (dp[k] == 1) {
    cout << "first";
  } else
    cout << "second";
}
int main() {
  int n, k;
  cin >> n >> k;
  int ar[n + 1];
  for (int i = 1; i <= n; i++) {
    cin >> ar[i];
  }
  solve(ar, n, k);
}
