#include <bits/stdc++.h>
using namespace std;
ifstream f("plantatie.in");
ofstream g("plantatie.out");
int pt[501][501][10],i,j,m,n,k,p,x,y;
int mx(int a, int b, int c, int d)
{
    return max(max(a,b),max(c,d));
}
int main()
{
    f>>n>>m;
    for(i=1; i<=n; i++)
        for(j=1; j<=n; j++)
            f>>pt[i][j][0];
    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++)
            {
                pt[i][j][k]=mx(pt[i][j][k-1],pt[i][j+(1<<(k-1))][k-1],pt[i+(1<<(k-1))][j][k-1],pt[i+(1<<(k-1))][j+(1<<(k-1))][k-1]);
            }



    for(i=1; i<=m; i++)
    {
        f>>x>>y>>k;
        p=log2(k);
        g<<mx(pt[x][y][p],pt[x][y+k-(1<<p)][p],pt[x+k-(1<<p)][y][p],pt[x+k-(1<<p)][y+k-(1<<p)][p])<<'\n';
    }

    return 0;
}