#include <bits/stdc++.h>

using namespace std;
ifstream f("plantatie.in");
ofstream g("plantatie.out");
int d[505][505][15],n,i,j,m,lg,l,x,y,mx,col,lin;
int main()
{
    f>>n>>m;
    for(i=1; i<=n; i++)
        for(j=1; j<=n; j++) f>>d[i][j][0];

    for(l=1; (1<<l)<=n; l++)
        for(i=1; i+(1<<(l-1))<=n; i++)
            for(j=1; j+(1<<(l-1))<=n; j++)
            {
                d[i][j][l]=max(d[i][j][l-1],max(d[i][j+(1<<(l-1))][l-1],max(d[i+(1<<(l-1))][j][l-1],d[i+(1<<(l-1))][j+(1<<(l-1))][l-1])));
            }

    for(i=1; i<=m; i++)
    {
        f>>x>>y>>l;
        lg=log2(l);
        col=y+l-1;
        lin=x+l-1;
        mx=max(d[x][y][lg],max(d[x][col-(1<<lg)+1][lg],max(d[lin-(1<<lg)+1][y][lg],d[lin-(1<<lg)+1][col-(1<<lg)+1][lg])));
        g<<mx<<'\n';
    }
    return 0;
}