#include <fstream>

using namespace std;

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

int n, m, log[502], i, d[11][501][501], j, a, t, b, k, lat, p;

int main(){
    log[1] = 0;
    for(i=2;i<=500;i++)
        log[i] = log[i/2] + 1;
    fin>>n>>m;
    for(i=1;i<=n;i++)
        for(j=1;j<=n;j++)
            fin>>d[0][i][j];
    for(t=1;t<=log[n] + 1;t++){
        a = (1<<t);
        for(i=1;i<=n;i++)
            for(j=1;j<=n;j++){
                d[t][i][j] = d[t-1][i][j];
                if(i+a/2 <= n)
                    d[t][i][j] = max(d[t][i][j], d[t-1][i+a/2][j]);
                if(j+a/2 <= n)
                    d[t][i][j] = max(d[t][i][j], d[t-1][i][j+a/2]);
                if(i+a/2 <= n && j+a/2 <= n)
                    d[t][i][j] = max(d[t][i][j], d[t-1][i+a/2][j+a/2]);
            }
    }

    while(m--){
        fin>>a>>b>>k;
        lat = log[k];
        p = (1<<lat);
        fout<<max(max(max(d[lat][a][b], d[lat][a+k-p][b]), d[lat][a][b+k-p]), d[lat][a+k-p][b+k-p])<<"\n";
    }
    return 0;
}