#include <fstream>
#define nmax 502
#define lgmax 16
using namespace std;
ifstream fin("plantatie.in");
ofstream fout("plantatie.out");

int rmq[nmax][nmax][lgmax];

int main()
{
    int n,m,x,y,z;
    fin>>n>>m;
    for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++)
            fin>>rmq[i][j][0];
    for(int k=1;(1<<k)<=n;k++)
        for(int i=1;i<=n-(1<<k-1)+1;i++)
            for(int j=1;j<=n-(1<<k-1)+1;j++)
            {int q=(1<<k-1);rmq[i][j][k]=max(rmq[i][j][k-1],max(rmq[i][j+q][k-1],max(rmq[i+q][j][k-1],rmq[i+q][j+q][k-1])));}
    for(int i=1;i<=m;i++)
    {
        fin>>x>>y>>z;
        int put=1;
        int p=0;
        while(put<=z){
            put*=2;
            p++;
        }
        p--;
        int q=z-(1<<p);
        fout<<max(rmq[x][y][p],max(rmq[x+q][y][p],max(rmq[x][y+q][p],rmq[x+q][y+q][p])))<<"\n";
    }
    return 0;
}