#include <bits/stdc++.h>
using namespace std;
int solution(int* arr, int n, int k) {
  int* dp = new int[k];
  for (int i = 0; i <= k; i++) {
    dp[i] = 0;
  }
  dp[0] = 0;
  for (int i = 1; i <= k; i++) {
    bool flag = 0;
    for (int j = 0; j < n; j++) {
      if (((i - arr[j]) >= 0) && (dp[i - arr[j]] == 0)) {
        flag = 1;
        break;
      }
    }
    dp[i] = flag;
  }
  return dp[k];
}
int main() {
  int n, k;
  cin >> n >> k;
  int* arr = new int[n];
  for (int i = 0; i < n; i++) {
    cin >> arr[i];
  }
  if (solution(arr, n, k)) {
    cout << "first" << endl;
  } else {
    cout << "second" << endl;
  }
}
