#include <bits/stdc++.h>
using namespace std;
int stones[101];
int dp[100001][2];
bool solve(bool Tairo, bool Gairo, int size, int pile_size) {
  if (pile_size < 0) {
    if (Tairo) {
      return 0;
    }
    if (Gairo) {
      return 1;
    }
  }
  if (pile_size == 0) {
    if (Tairo) {
      return 1;
    }
    if (Gairo) {
      return 0;
    }
  }
  if (Tairo) {
    if (dp[pile_size][0] != -1) {
      return dp[pile_size][0];
    }
  }
  if (Gairo) {
    if (dp[pile_size][1] != -1) {
      return dp[pile_size][1];
    }
  }
  bool final_win = 0;
  bool final_win1 = 1;
  for (int i = 0; i < size; i++) {
    if (stones[i] <= pile_size) {
      if (!Tairo) {
        bool win = solve(1, 0, size, pile_size - stones[i]);
        final_win = (final_win || win);
      }
      if (Tairo and !Gairo) {
        bool win1 = solve(0, 1, size, pile_size - stones[i]);
        final_win1 = (final_win1 and win1);
      }
    }
  }
  if (!Tairo) {
    dp[pile_size][1] = final_win;
    return final_win;
  }
  if (Tairo and !Gairo) {
    dp[pile_size][0] = final_win1;
    return final_win1;
  }
  return 0;
}
int main() {
  int N, K;
  cin >> N >> K;
  memset(dp, -1, sizeof(dp));
  for (int i = 0; i < N; i++) {
    cin >> stones[i];
  }
  if (solve(0, 0, N, K)) {
    cout << "first";
  } else {
    cout << "second";
  }
}
