#include <bits/stdc++.h>
using namespace std;
ifstream in("plantatie.in");
ofstream out("plantatie.out");
int l[502],r[502][502][10];
int main()	
{
    int n,m,i,j,k,nr;
    in>>n>>m;
    for(i=2;i<=n;i++)
        l[i]=1+l[i/2];
    for(i=1;i<=n;i++)
        for(j=1;j<=n;j++)
            in>>r[i][j][0];
    for(k=0;k<=l[n];k++)
        for(i=1;i+(1<<k)<=n;i++)
            for(j=1;j+(1<<k)<=n;j++)
                r[i][j][k+1]=max(max(r[i][j][k],r[i+(1<<k)][j][k]),max(r[i][j+(1<<k)][k],r[i+(1<<k)][j+(1<<k)][k]));
    while(m--)
    {
        in>>i>>j>>k;
        nr=l[k];
        out<<max(max(r[i][j][nr],r[i+k-(1<<nr)][j][nr]),max(r[i][j+k-(1<<nr)][nr],r[i+k-(1<<nr)][j+k-(1<<nr)][nr]))<<"\n";
    }
    return 0;
}