#include <bits/stdc++.h>
using namespace std;
const int nmax = 101234;
int n, k, a[112], dp[nmax];
int main() {
  scanf("%d %d", &n, &k);
  for (int i = 0; i < n; ++i) {
    scanf("%d", &a[i]);
  }
  for (int i = 1; i <= k; ++i) {
    for (int j = 0; j < n && a[j] <= i; ++j) {
      if (dp[i - a[j]] == 0) {
        dp[i] = 1;
        break;
      }
    }
  }
  if (dp[k] == 1)
    printf("first");
  else
    printf("second");
  return 0;
}
