#include <bits/stdc++.h>
using namespace std;
int stones(vector<int>& v, int k) {
  int dp[k + 1];
  memset(dp, 0, sizeof(dp));
  for (int i = 1; i <= k; i++) {
    for (int x : v) {
      if (i < x) continue;
      if (dp[i - x] == 0) dp[i] = 1;
    }
  }
  return dp[k];
}
void solve() {
  int n, k;
  cin >> n >> k;
  vector<int> v;
  for (int i = 0; i < n; i++) {
    int x;
    cin >> x;
    v.push_back(x);
  }
  if (stones(v, k) == 1)
    cout << "first";
  else
    cout << "second";
}
int main() {
  solve();
  return 0;
}
