#include <bits/stdc++.h>
using namespace std;
bool prime[10000001];
void sieveFunction(long long int maxLimit) {
  memset(prime, true, sizeof(prime));
  prime[0] = prime[1] = false;
  for (long long int i = 2; maxLimit >= i; i++) {
    if (prime[i]) {
      for (long long int j = 2 * i; maxLimit >= j; j += i) prime[j] = false;
    }
  }
}
signed main() {
  long long int n, k;
  cin >> n >> k;
  vector<long long int> v(n);
  long long int ma = 0;
  for (long long int i = 0; i < n; i++) {
    cin >> v[i];
    ma = max(ma, v[i]);
  }
  long long int dp[k + 1];
  dp[0] = 0;
  for (long long int i = 0; i < k + 1; i++) dp[i] = -1;
  for (long long int i = 0; i < n; i++) dp[v[i]] = 1;
  for (long long int i = 0; i < ma + 1; i++)
    if (dp[i] == -1) dp[i] = 0;
  for (long long int i = 0; i < k + 1; i++) {
    for (long long int j = 0; j < n; j++) {
      if (dp[i] == -1 && i - v[j] >= 0 && dp[i - v[j]] == 0) dp[i] = 1;
    }
    if (dp[i] != 1) dp[i] = 0;
  }
  if (dp[k] == 1)
    cout << "first"
         << "\n";
  else
    cout << "second"
         << "\n";
}
