#include <bits/stdc++.h>
using namespace std;
int n, arr[102];
int dp[100004][2];
int solve(int turn, int k) {
  if (k < 0) {
    return (turn);
  }
  if (k == 0) {
    return !turn;
  }
  if (dp[k][turn] == -1) {
    int i;
    for (i = 0; i < n; i++) {
      int a1 = solve(!turn, k - arr[i]);
      if (a1 == turn) {
        dp[k][turn] = turn;
        return turn;
      }
    }
    dp[k][turn] = !turn;
  }
  return dp[k][turn];
}
int main() {
  int k;
  cin >> n >> k;
  int i;
  memset(dp, -1, sizeof(dp));
  for (i = 0; i < n; i++) {
    cin >> arr[i];
  }
  int ans = solve(0, k);
  if (ans == 0)
    cout << "first";
  else {
    cout << "second";
  }
  return 0;
}
