#include <bits/stdc++.h>

using namespace std;
ifstream f("plantatie.in");
ofstream g("plantatie.out");
int d[501][501][15],n,m,i,j,k,maxim1,maxim2,q,i1,jj1;
int main()
{
    f>>n>>m;
    for(i=1;i<=n;i++)
        for(j=1;j<=n;j++)
        f>>d[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++)
            {
                maxim1=max(d[i][j][k-1],d[i][j+(1<<(k-1))][k-1]);
                maxim2=max(d[i+(1<<(k-1))][j][k-1],d[i+(1<<(k-1))][j+(1<<(k-1))][k-1]);
                d[i][j][k]=max(maxim1,maxim2);
            }
        }
    }
   for(q=1;q<=m;q++)
   {
       f>>i>>j>>k;
       i1=i+k-1;
       jj1=j+k-1;
       int x=log2(k);
       maxim1=max(d[i][j][x],d[i][jj1-(1<<x)+1][x]);
       maxim2=max(d[i1-(1<<x)+1][j][x],d[i1-(1<<x)+1][jj1-(1<<x)+1][x]);
       g<<max(maxim1,maxim2)<<'\n';
   }
    return 0;
}