#include <iostream>
#include <fstream>
#include <algorithm>
#include <cmath>

#define INF 1000000000
using namespace std;

//ifstream f("in.in");
//ofstream g("out.out");

ifstream f("plantatie.in");
ofstream g("plantatie.out");

int n,m,v[50][400][400];
int x,y,k;
int E[100005];

int main()
{
    f>>n>>m;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            f>>v[0][i][j];
        }
    }

    for(int e=1;(1<<e)<=n;e++){
        for(int i=1;i<=n;i++){
            for(int j=1;j<=n;j++){
                v[e][i][j] = v[e-1][i][j];
                int len = (1<<(e-1));
                if(i+len <= n){
                    v[e][i][j] = max(v[e][i][j],v[e-1][i+len][j]);
                }
                if(j+len <= n){
                    v[e][i][j] = max(v[e][i][j],v[e-1][i][j+len]);
                }
                if(i+len <= n && j+len <= n){
                    v[e][i][j] = max(v[e][i][j],v[e-1][i+len][j+len]);
                }
            }
        }
    }

    E[1] = 0;
    for(int i=2;i<=n;i++){
        E[i] = E[i/2]+1;
    }

    for(int i=1;i<=m;i++){
        f>>x>>y>>k;
        int e = E[k];
        int len = (1<<e);

        g<<max(max(v[e][x][y],v[e][x][y+k-len]),max(v[e][x+k-len][y],v[e][x+k-len][y+k-len]))<<'\n';
    }

    return 0;
}