#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e18;
const long long maxn = 2e5 + 10;
const long long mod = 1e9 + 7;
long long n, m, k;
long long dp[maxn], a[maxn];
int main() {
  cin >> n >> k;
  for (long long i = 1; i <= n; i++) cin >> a[i];
  for (long long i = 1; i <= k; i++)
    for (long long j = 1; j <= n; j++)
      if (a[j] <= i) dp[i] = max(dp[i], 1 - dp[i - a[j]]);
  if (dp[k] == 1)
    cout << "first";
  else
    cout << "second";
}
