#include <bits/stdc++.h>

using namespace std;
ifstream f("plantatie.in");
ofstream g("plantatie.out");
int d[9][505][505],n,m,k,x,y;
int maxim(int a, int b, int c, int d)
{
    return max(max(a,b),max(c,d));
}
int main()
{f>>n>>m;
for(int i=1;i<=n;i++)
    for(int j=1;j<=n;j++)
    f>>d[0][i][j];

for(int p=1;(1<<p)<=n;p++)
    for(int i=1;i+(1<<p)-1<=n;i++)
        for(int j=1;j+(1<<p)-1<=n;j++)
            d[p][i][j]=maxim(d[p-1][i][j],d[p-1][i+(1<<(p-1))][j],d[p-1][i][j+(1<<(p-1))],d[p-1][i+(1<<(p-1))][j+(1<<(p-1))]);
for(int i=1;i<=m;i++)
{
    f>>x>>y>>k;
    int p=log2(k);
    int rez;
    int s=1<<(p);
    rez=maxim(d[p][x][y],d[p][x+k-s][y],d[p][x][y+k-s],d[p][x+k-s][y+k-s]);
    g<<rez<<'\n';
}
    return 0;
}