#include <bits/stdc++.h>
using namespace std;
long long a[100005];
long long dp[100005];
long long n;
long long solve(int k) {
  if (dp[k]) return dp[k];
  for (int i = 0; i < n; i++) {
    if (k >= a[i]) {
      if (solve(k - a[i]) == 2) {
        dp[k] = 1;
        return dp[k];
      }
    }
  }
  dp[k] = 2;
  return dp[k];
}
int main() {
  long long k;
  cin >> n >> k;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  memset(dp, 0, sizeof(dp));
  dp[0] = 2;
  (solve(k) == 2) ? cout << "first" : cout << "second";
  cout << endl;
  return 0;
}
