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

    ifstream fin("plantatie.in");
    ofstream fout("plantatie.out");

    int rmq[17][502][502];
    int pw[502];

    int main(){
        int n, m; fin >> n >> m;

        for (int i = 2; i <= n; ++i) pw[i] = 1 + pw[i >> 1];

        for(int i = 1; i <= n; i++)
            for(int j = 1; j <= n; j++)
                fin >> rmq[0][i][j];


        for(int p = 1, dim = 2; dim <= n; p++, dim <<= 1) {
            for(int i = 1; i <= n - dim + 1; i++) {
                for(int j = 1; j <= n - dim + 1; j++) {
                    int x = i + (dim >> 1), y = j + (dim >> 1);
                    rmq[p][i][j] = max(
                        max(rmq[p - 1][i][j], rmq[p - 1][i][y]),
                        max(rmq[p - 1][x][j], rmq[p - 1][x][y])
                    );
                }
            }
        }


        for (int t = 0; t < m; t++) {
            int row, col, dim;
            fin >> row >> col >> dim;
            int level = pw[dim];
            int length = (1 << level);

            fout << max(
                max(rmq[level][row][col], rmq[level][row][col + dim - length]),
                max(rmq[level][row + dim - length][col], rmq[level][row + dim - length][col + dim - length])
            ) << "\n";
        }

    }