#include <bits/stdc++.h>

using namespace std;

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

int n,m;
int rmq[505][505][15],p[505];

void Puteri()
{
    for(int i=2;i<=n;i++)
        p[i]=1+p[i/2];
}

void BUILD()
{
    int L=p[n],aux;

    for(int k=1;k<=L;k++)
        for(int i=1;i<=n-(1<<(k-1));i++)
            for(int j=1;j<=n-(1<<(k-1));j++)
            {
                aux=(1<<(k-1));
                rmq[i][j][k]=max({rmq[i][j][k-1],rmq[i+aux][j][k-1],rmq[i][j+aux][k-1],rmq[i+aux][j+aux][k-1]});
            }
}

int main()
{
    fin>>n>>m;

    for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++)
            fin>>rmq[i][j][0];

    Puteri();
    BUILD();

    int x,y,l,P,maxim;
    while(m--)
    {
        fin>>x>>y>>l;
        P=p[l];
        maxim=max({rmq[x][y][P],rmq[x+l-(1<<P)][y][P],rmq[x][y+l-(1<<P)][P],rmq[x+l-(1<<P)][y+l-(1<<P)][P]});
        fout<<maxim<<"\n";
    }

    fin.close();
    fout.close();
    return 0;
}