#include <bits/stdc++.h>
using namespace std;
int dp[100005][3];
int a[105], n;
int func(int i, int j) {
  if (i == 0) {
    return 0;
  }
  if (dp[i][j] != -1) return dp[i][j];
  int ans = 0;
  for (int k = 0; k < n; k++) {
    if (a[k] <= i) {
      if (j == 1 and func(i - a[k], 2) == 0) ans = 1;
      if (j == 2 and func(i - a[k], 1) == 0) ans = 1;
    }
  }
  return dp[i][j] = ans;
}
int main() {
  int k;
  cin >> n >> k;
  for (int i = 0; i < n; i++) cin >> a[i];
  memset(dp, -1, sizeof dp);
  if (func(k, 1))
    cout << "first";
  else
    cout << "second";
}
