#include <bits/stdc++.h>
using namespace std;
long long pow(long long a, long long b, long long m) {
  long long ans = 1;
  while (b) {
    if (b & 1) ans = (ans * a) % m;
    b /= 2;
    a = (a * a) % m;
  }
  return ans;
}
long long modInv(long long a, long long m) {
  a = a % m;
  for (long long x = 1; x < m; x++)
    if ((a * x) % m == 1) return x;
}
long long modinv(long long a, long long m) { return pow(a, m - 2, m); }
const long long N = 1005;
long long a[105];
long long n, k;
long long dp[105] = {0};
void solve() {
  cin >> n >> k;
  for (long long i = 0; i < n; ++i) cin >> a[i];
  sort(a, a + n);
  for (long long i = 1; i <= k; ++i) {
    long long j = 0;
    for (long long j = 0; j < n; ++j) {
      if (i - a[j] >= 0 and dp[i - a[j]] == 0) {
        dp[i] = 1;
        break;
      }
    }
  }
  (!dp[k]) ? cout << "second" : cout << "first";
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  solve();
}
