#include <bits/stdc++.h>

using namespace std;
ifstream fin("plantatie.in");
ofstream fout("plantatie.out");
int dp[10][501][501];
int lg[501];
int n,q,i,j,k,l,rs;
int main()
{
    fin>>n>>q;
    for(i=2;i<=n;i++)lg[i]=1+lg[i/2];
    for(i=1;i<=n;i++)
        for(j=1;j<=n;j++)fin>>dp[0][i][j];
    for(k=1;(1<<k)<=n;k++)
        for(i=1;i<=n-(1<<k)+1;i++)
            for(j=1;j<=n-(1<<k)+1;j++)
                dp[k][i][j]=max(dp[k-1][i][j],max(dp[k-1][i+(1<<(k-1))][j],max(dp[k-1][i][j+(1<<(k-1))],dp[k-1][i+(1<<(k-1))][j+(1<<(k-1))])));
    while(q--)
    {
        fin>>i>>j>>k;
        l=lg[k];
        rs=k-(1<<l);
        fout<<max(dp[l][i][j],max(dp[l][i+rs][j],max(dp[l][i][j+rs],dp[l][i+rs][j+rs])))<<"\n";
    }
    return 0;
}