#include <bits/stdc++.h>
#define Nmax 501
using namespace std;
ifstream f("plantatie.in");
ofstream g("plantatie.out");
int a[Nmax][Nmax][11];
int main()
{
    int n,m,i,j,k;
    f>>n>>m;
    for(i=1;i<=n;i++)
        for(j=1;j<=n;j++)
        f>>a[i][j][0];
    int p=log2(n);
    for(k=1;k<=p;k++)
        for(i=1;i<=n-(1<<k)+1;i++)
            for(j=1;j<=n-(1<<k)+1;j++)
                a[i][j][k]=max(a[i][j][k-1],max(max(a[i+(1<<(k-1))][j][k-1],a[i][j+(1<<(k-1))][k-1]),a[i+(1<<(k-1))][j+(1<<(k-1))][k-1]));
    for(;m;--m)
    {
        f>>i>>j>>p;
        k=log2(p);
        g<<max(a[i][j][k],max(max(a[i+p-(1<<k)][j][k],a[i][j+p-(1<<k)][k]),a[i+p-(1<<k)][j+p-(1<<k)][k]))<<'\n';
    }

    return 0;
}