#include <bits/stdc++.h>
using namespace std;
int arr[101];
int n, k;
int dp[100001];
bool solve(int k) {
  if (k == 0) return 0;
  if (dp[k] != -1) return dp[k];
  for (int i = 0; i < n; i++)
    if (k >= arr[i])
      if (!solve(k - arr[i])) return dp[k] = 1;
  return dp[k] = 0;
}
int main() {
  memset(dp, -1, sizeof(dp));
  cin >> n >> k;
  for (int i = 0; i < n; i++) cin >> arr[i];
  if (solve(k))
    cout << "first";
  else
    cout << "second";
}
