#include <bits/stdc++.h>
using namespace std;
int dp[100005];
int a[3000], n, k, mn;
bool calc(int m) {
  if (dp[m] != -1) return dp[m];
  dp[m] = 0;
  for (int i = 0; i < n; ++i) {
    if (a[i] <= m && !calc(m - a[i])) {
      dp[m] = 1;
    }
  }
  return dp[m];
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  memset(dp, -1, sizeof(dp));
  cin >> n >> k;
  for (int i = 0; i < n; ++i) {
    cin >> a[i];
    mn = min(mn, a[i]);
  }
  cout << (calc(k) ? "first" : "second") << endl;
  return 0;
}
