#include <bits/stdc++.h>
using namespace std;
const long long inf = 1e17;
const long long N = 1e4 + 10;
const long long bits = 30;
const long long mod = 1e9 + 7;
long long dp[N][2];
long long arr[N];
int solve(int k, int pl, int n) {
  if (k < 0) {
    return pl;
  }
  if (k == 0) {
    return !pl;
  }
  if (dp[k][pl] != -1) {
    return dp[k][pl];
  }
  dp[k][pl] = !pl;
  for (int i = 0; i < n; i++) {
    if (pl == solve(k - arr[i], !pl, n)) {
      dp[k][pl] = pl;
      break;
    }
  }
  return dp[k][pl];
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  int n;
  cin >> n;
  int k;
  cin >> k;
  for (int i = 0; i <= k; i++) {
    dp[i][0] = dp[i][1] = -1;
  }
  for (int i = 0; i < n; i++) {
    cin >> arr[i];
  }
  if (!solve(k, 0, n)) {
    cout << "first\n";
  } else {
    cout << "second\n";
  }
}
