#include <fstream>
using namespace std;
ifstream fin("plantatie.in");
ofstream fout("plantatie.out");
int lg[512],mat[10][501][501],n,m,i,j,k,lin,col,linfin,colfin,diff,ans,half,lat,log;
int main()
{
    fin>>n>>m;
    for(i=1;i<=n;i++)
        for(j=1;j<=n;j++)
            fin>>mat[0][i][j];
    for(i=2;i<=512;i++)
        lg[i]=lg[i/2]+1;
    for(k=1;(1 << k)<=n;k++)
        for(i=1;i+(1 << k)-1<=n;i++)
            for(j=1;j+(1 << k)-1<=n;j++)
            {
                half = 1 << (k-1);
                mat[k][i][j]=max(mat[k][i][j],mat[k-1][i][j]);
                mat[k][i][j]=max(mat[k][i][j],mat[k-1][i][j+half]);
                mat[k][i][j]=max(mat[k][i][j],mat[k-1][i+half][j]);
                mat[k][i][j]=max(mat[k][i][j],mat[k-1][i+half][j+half]);
            }
    for(i=1;i<=m;i++)
    {
        fin>>lin>>col>>lat;
        linfin=lin+lat-1;
        colfin=col+lat-1;
        diff=linfin-lin+1;
        log=diff=lg[diff];
        diff= 1 << diff;
        ans=max(mat[log][lin][col],max(mat[log][lin][colfin-diff+1],max(mat[log][linfin-diff+1][j],mat[log][linfin-diff+1][colfin-diff+1])));
        fout<<ans<<'\n';
    }

    return 0;
}