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

inline void solve() {
    int n, m;
    cin >> n >> m;
    
    vector g(n, vector<int>(m));
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            cin >> g[i][j];
        }
    }

    auto check = [&] (int x, int y) -> bool {
        return (x >= n || y >= m || g[x][y] == -1);
    };
    LL res = 0;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            if (g[i][j] == -1) continue;
            if (check(i + 1, j) && check(i, j + 1)) {
                res ^= g[i][j];
            }

        }
    }
    
    if (res) {
        cout << "first\n";
    } else {
        cout << "second\n";
    }
    return;
}

signed main() {
    cin.tie(0)->sync_with_stdio(0);
    int t = 1;
    while (t--)
        solve();
    return 0;
}