#include <iostream>
#include <stdio.h>
#include <algorithm>
using namespace std;
FILE *f,*g;
int a[10][500][500];
int log2[500];
int n,m;
void read()
{
    fscanf(f,"%d %d",&n,&m);
    for(int i=1; i<=n; i++)
        for(int j=1; j<=n; j++)
            fscanf(f,"%d ",&a[0][i][j]);
}
void logarithm()
{
    for(int i=2; i<=n; i++)
        log2[i]=log2[i/2]+1;
}
int maxim(int a, int b)
{
    return a>b ? a:b;
}
void solve()
{   int pow;
    logarithm();
    for(int k=1; k<=log2[n]; k++)
    {
        pow=1<<(k-1);
        for(int i=1; i<=n-(1<<k)+1; i++)
        {
            for(int j=1; j<=n-(1<<k)+1; j++)
            {
                a[k][i][j]=maxim(a[k-1][i][j],
                                 maxim(a[k-1][i][j+pow],
                                  maxim(a[k-1][i+pow][j], a[k-1][i+pow][j+pow])));
            }
        }
    }
}
void write()
{   int i,j,k,pow,l;
    for(int ii=1; ii<=m; ii++)
    {
        fscanf(f,"%d %d %d",&i,&j,&l);
        k=log2[l];
        pow=1<<k;
        fprintf(g,"%d\n",maxim(a[k][i][j],
                             maxim(a[k][i][j+l-pow],
                                     maxim(a[k][i+l-pow][j], a[k][i+l-pow][j+l-pow]))));
    }
}
void afisare_fake()
{
    for(int i=0; i<=log2[n]; i++);
}
int main()
{
    f=fopen("plantatie.in","r");
    g=fopen("plantatie.out","w");
    read();
    solve();
    write();
    fclose(f);
    fclose(g);
    return 0;
}