#include <bits/stdc++.h>
using namespace std;
template <class T>
inline void input(T &x) {
  register char c = getchar();
  x = 0;
  int neg = 0;
  for (; ((c < 48 || c > 57) && c != '-'); c = getchar())
    ;
  if (c == '-') {
    neg = 1;
    c = getchar();
  }
  for (; c > 47 && c < 58; c = getchar()) {
    x = (x << 1) + (x << 3) + c - 48;
  }
  if (neg) x = -x;
}
inline long long bigmod(long long p, long long e, long long M) {
  long long ret = 1;
  for (; e > 0; e >>= 1) {
    if (e & 1) ret = (ret * p) % M;
    p = (p * p) % M;
  }
  return ret;
}
template <class T>
inline T gcd(T a, T b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
template <class T>
inline T modinverse(T a, T M) {
  return bigmod(a, M - 2, M);
}
const int N = 3e5 + 5;
int a[N];
int dp[N];
int main() {
  int n, k;
  input(n), input(k);
  for (int i = 1; i <= n; i++) input(a[i]);
  dp[0] = 0;
  for (int i = 1; i <= k; i++) {
    dp[i] = 0;
    for (int j = 1; j <= n; j++) {
      if (i >= a[j] && dp[i - a[j]] == 0) {
        dp[i] = 1;
      }
    }
  }
  printf("%s", dp[k] ? "first" : "second");
}
