#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
bool dp[100000];
int main() {
  int n, k;
  cin >> n >> k;
  vector<int> a(n);
  for (int i = 0; i < (n); ++i) cin >> a[i];
  for (int i = 0; i < (k); ++i) {
    if (i < a[0])
      dp[i] = false;
    else
      for (int j = 0; j < (n); ++j) {
        if ((i >= a[j]) && (dp[i - a[j]] == false)) {
          dp[i] = true;
          break;
        }
        dp[i] = false;
      }
  }
  if (dp[n] == false)
    cout << "second" << endl;
  else
    cout << "first" << endl;
}
