#include <bits/stdc++.h>
using namespace std;
ifstream fin("plantatie.in");
ofstream fout("plantatie.out");

int r[17][501][75001];
int E[75001];
int n, m, ic, jc, l, e, len, i2, j2;

int main() {
    fin >> n >> m;
    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= n; j++)
            fin >> r[0][i][j];
        
    for (int p = 1, lat = 2; lat <= n; p++, lat*=2){
        for (int i1 = 1; i1 <= n - lat + 1; i1++){
            for (int j1 = 1; j1 <= n - lat + 1; j1++){
                i2 = i1 + (lat >> 1);
                j2 = j1 + (lat >> 1);
                r[p][i1][j1] = max(max(r[p-1][i1][j1], r[p-1][i2][j1]), max(r[p-1][i1][j2], r[p-1][i2][j2]));
            }
        }
    }
    
    E[1] = 0;
    for (int i = 2; i <= n; i++)
        E[i] = 1 + E[i/2];
        
    for(int i = 1; i <= m; i++) {
        fin >> ic >> jc >> l;
        e = E[l];
        len = (1 << e);
        i2 = ic + l - len;
        j2 = jc + l - len;
        fout << max(max(r[len][ic][jc], r[len][ic][j2]), max(r[len][i2][jc], r[len][i2][j2])) << endl;
    }
    
    return 0;
}