#include <bits/stdc++.h>
using namespace std;
int64_t exponentiation(int64_t base, int exp) {
  if (exp == 0) return 1;
  if (exp == 1) return base;
  int64_t t = exponentiation(base, exp / 2);
  t = (t * t);
  if (exp % 2 == 0)
    return t;
  else
    return base * t;
}
int dp[2][(int)(1e5 + 5)];
int solve(vector<int>& arr, int player, int value) {
  if (value < arr[0]) {
    return player ^ 1;
  }
  if (dp[player][value] != -1) return dp[player][value];
  int i = 0;
  while (i != arr.size()) {
    if (arr[i] > value) break;
    if (player == solve(arr, player ^ 1, value - arr[i])) {
      dp[player][value] = player;
      return player;
    }
    i++;
  }
  dp[player][value] = player ^ 1;
  return player ^ 1;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ;
  int q = 1;
  memset(dp, -1, sizeof(dp));
  while (q--) {
    int n, k;
    cin >> n >> k;
    vector<int> arr(n);
    for (auto& item : arr) cin >> item;
    int ans = solve(arr, 0, k);
    if (ans)
      cout << "second";
    else
      cout << "first";
  }
  return 0;
}
