#include <bits/stdc++.h>
using namespace std;
double dp[301][300][301];
double get(long long int x, long long int y, long long int z, long long int n) {
  if (x < 0 || y < 0 || z < 0) return 0;
  if (x == 0 && y == 0 && z == 0) return 0;
  if (dp[x][y][z] > 0.9) return dp[x][y][z];
  double exp = n + x * get(x - 1, y, z, n) + y * get(x + 1, y - 1, z, n) +
               z * get(x, y + 1, z - 1, n);
  return dp[x][y][z] = exp / (x + y + z);
}
void solve() {
  long long int n, k;
  cin >> n >> k;
  long long int arr[n];
  for (int i = 0; i < (n); ++i) cin >> arr[i];
  long long int dp[k + 1];
  dp[0] = 0;
  for (int i = 1; i <= (k); ++i) {
    dp[i] = 0;
    for (int j = 0; j < (n); ++j) {
      if (i >= arr[j]) {
        if (dp[i - arr[j]] == 0) {
          dp[i] = 1;
          break;
        }
      } else {
        break;
      }
    }
  }
  if (dp[k] == 1) {
    cout << "first" << '\n';
  } else {
    cout << "second" << '\n';
  }
}
int main() {
  int t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
