#include <bits/stdc++.h>
using namespace std;

void solve() {
     int n, m; cin >> n >> m;
     vector <vector<int>> a(n, vector<int>(m, 0));
     for (int i = 0; i < n; i++)
        for (int j = 0; j < m; j++)
            cin >> a[i][j];
     int sum = 0;
     auto in = [&](int i, int j) -> bool {
        if (i < 0 || j < 0 || i >= n || j >= m) return false;
        if (a[i][j] == -1) return false;
        return true;
     };
     for (int i = 0; i < n; i++)
     for (int j = 0; j < m; j++) {
        bool corner = 1;
        if (a[i][j] == -1) continue;
        if (a[i][j] == 0) continue;
        if (in(i + 1, j)) corner = 0;
        if (in(i, j + 1)) corner = 0;


        /// corner --> NIM
        if (corner) sum ^= a[i][j];
        /// not corner --> MISERE NIM
        if (!corner) {
            if (a[i][j] == 1) sum ^= 0;
            else sum ^= a[i][j];
        }
     }
     if (sum == 0) cout << "second\n";
     else cout << "first\n";
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr); cout.tie(nullptr);
    int t = 1;// cin >> t;
    while (t--) {
        solve();
    }
}

/**
5 6
0 0 0 0 0 0
0 3 3 0 0 0
0 0 3 -1 0 0
0 0 3 3 3 3
0 0 -1 -1 -1 -1

**/