#include <bits/stdc++.h>
using namespace std;
double PI = acos(-1);
int n, k, arr[105], dp[100005][2];
bool solve(int sum, int p) {
  bool check = 1;
  bool ret;
  if (dp[sum][p] != -1) return dp[sum][p];
  if (p)
    ret = 1;
  else
    ret = 0;
  for (int i = 0; i < n; i++) {
    if (sum >= arr[i]) {
      check = 0;
      if (p)
        ret = ret && solve(sum - arr[i], 1 - p);
      else
        ret = ret || solve(sum - arr[i], 1 - p);
    }
  }
  if (check == 0) return dp[sum][p] = ret;
  return dp[sum][p] = p;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> k;
  memset(dp, -1, sizeof dp);
  for (int i = 0; i < n; i++) cin >> arr[i];
  if (solve(k, 0) == 1)
    cout << "first\n";
  else
    cout << "second\n";
  return 0;
}
