//nu ii frumos sa te uiti pe sursele altora:))...hotule....nu o sti face singur?:))
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("plantatie.in");
ofstream fout("plantatie.out");

#define MAX 502
int a[MAX][MAX][10], log2[MAX];

int main()
{
    int n, m, i, j, k, x, y, lat, g;
    fin>>n>>m;
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=n;j++)
        {
            fin>>a[i][j][0];
        }
    }
    log2[1]=0;
    for(i=2;i<=n;i++)
    {
        log2[i]=log2[i/2]+1;
    }
    for(k=1;(1<<k)<=n;k++)
    {
        for(i=1;i<=n;i++)
        {
            for(j=1;j<=n;j++)
            {
                a[i][j][k]=a[i][j][k-1];
                if(j+(1<<(k-1))<=n)
                    a[i][j][k]=max(a[i][j][k], a[i][j+(1<<(k-1))][k-1]);
                if(i+(1<<(k-1))<=n)
                    a[i][j][k]=max(a[i][j][k], a[i+(1<<(k-1))][j][k-1]);
                if(i+(1<<(k-1))<=n && j+(1<<(k-1))<=n)
                    a[i][j][k]=max(a[i][j][k], a[i+(1<<(k-1))][j+(1<<(k-1))][k-1]);
            }
        }
    }
    for(i=1;i<=m;i++)
    {
        fin>>x>>y>>lat;

        g=log2[lat];

        k=max(
                  max(
                    a[x][y][g],
                    a[x][y+lat-(1<<g)][g]
                      ),
                  max(
                      a[x+lat-(1<<g)][y][g],
                      a[x+lat-(1<<g)][y+lat-(1<<g)][g]
                      )
              );
            fout<<k<<"\n";

    }
}