#include <bits/stdc++.h>
using namespace std;
void solve() {
  int n, k;
  cin >> n >> k;
  bool dp[k + 1];
  memset(dp, false, sizeof(dp));
  set<int> s;
  for (int i = 0; i < n; i++) {
    int a;
    cin >> a;
    s.insert(a);
  }
  dp[0] = false;
  for (int i = 1; i < k + 1; i++) {
    for (auto x : s) {
      if ((i - x) >= 0 && dp[i - x] == false) {
        dp[i] = true;
        break;
      }
    }
  }
  if (dp[k] == true)
    cout << "first";
  else
    cout << "second";
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  solve();
}
