#include <bits/stdc++.h>
using namespace std;
template <typename T>
void print_vector_debug(const T& t) {
  cout << "[DEBUG] VECTOR:";
  for (auto i = t.cbegin(); i != t.cend(); ++i) {
    if ((i + 1) != t.cend()) {
      cout << *i << " ";
    } else {
      cout << *i << endl;
    }
  }
}
int N, K;
int vals[105];
int dp[100005][2], vis[100005][2];
int solve(int r, int t) {
  if (vis[r][t]) {
    return dp[r][t];
  }
  vis[r][t] = 1;
  int res;
  if (t == 0) {
    res = 0;
    for (int i = 0; i < N; i++) {
      if (r - vals[i] >= 0) {
        res |= solve(r - vals[i], !(bool)t);
      }
    }
  } else {
    res = 1;
    for (int i = 0; i < N; i++) {
      if (r - vals[i] >= 0) {
        res &= solve(r - vals[i], !(bool)t);
      }
    }
  }
  dp[r][t] = res;
  return res;
}
int main() {
  scanf("%d%d", &N, &K);
  for (int i = 0; i < N; i++) {
    scanf("%d", &vals[i]);
  }
  if (solve(K, 0) == 1) {
    printf("first\n");
  } else {
    printf("second\n");
  }
  return 0;
}
