#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
string solve(vector<int>& v, int k) {
  bool dp[k + 1];
  memset(dp, 0, sizeof dp);
  for (int i = 1; i <= k; i++) {
    for (int move : v) {
      if (move > i) continue;
      if (dp[i - move] == 0) dp[i] = 1;
    }
  }
  return dp[k] ? "first" : "second";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  int n;
  cin >> n;
  int k;
  cin >> k;
  vector<int> A(n);
  for (int i = 0; i <= n; i++) cin >> A[i];
  cout << solve(A, k);
  return 0;
}
