#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, k;
  cin >> n >> k;
  vector<int> vect(n);
  for (int i = 0; i < n; i++) cin >> vect[i];
  sort(vect.begin(), vect.end());
  vector<bool> dp(k + 1);
  int mn = vect[0];
  int flag;
  for (flag = 0; flag < mn; flag++) dp[flag] = false;
  for (int i = flag; i <= k; i++) {
    for (int j = 0; vect[j] <= i && j < n; j++) {
      if (dp[i - vect[j]] == false) {
        dp[i] = true;
        break;
      } else
        dp[i] = false;
    }
  }
  if (dp[k])
    cout << "first";
  else
    cout << "second";
  return 0;
}
