#include <bits/stdc++.h>
using namespace std;
int memo[100005][2];
int dp(int rem, int move, int a[], int n) {
  if (rem < 0) {
    return 1;
  }
  if (memo[rem][move] != -1) {
    return memo[rem][move];
  }
  bool flag = 0;
  for (int i = 0; i < n; ++i) {
    int ret;
    ret = dp(rem - a[i], move ^ 1, a, n);
    if (ret == 0) {
      flag = 1;
    }
  }
  return memo[rem][move] = flag;
}
int main() {
  int n, k;
  scanf("%d%d", &n, &k);
  int a[n + 5];
  for (int i = 0; i < n; ++i) {
    scanf("%d", &a[i]);
  }
  memset(memo, -1, sizeof memo);
  if (dp(k, 0, a, n)) {
    printf("first\n");
  } else {
    printf("second\n");
  }
  return 0;
}
