#include <iostream>
#include <cstdio>
#include <functional>
#define NMAX 502

using namespace std;

int lg[NMAX], m[NMAX][NMAX][11], n, x;

void read()
{
    freopen("plantatie.in", "r", stdin);
    freopen("plantatie.out", "w", stdout);

    scanf("%i %i", &n, &x);

    for(int i=1; i<=n; i++)
        for(int j=1; j<=n; j++)
            scanf("%i", &m[i][j][1]);
}

void pre()
{
    //Logarithm
    lg[1]=0;
    for(int i=2; i<NMAX; i++)
        lg[i]=lg[i/2]+1;

    //RMQ
    for(int i=2; i<=lg[n]+1; i++)
    {
        int p=1<<(i-2);
        for(int j=1; j<=n-p; j++)
            for(int k=1; k<=n-p; k++)
            {
                m[j][k][i]=max(max(m[j][k][i-1], m[j][k+p][i-1]), max(m[j+p][k][i-1], m[j+p][k+p][i-1]));
            }
    }
}

void query()
{
    int a, b, c;
    for(int i=1;i<=x;i++)
    {
    scanf("%i %i %i", &a, &b, &c);
    int lgc=lg[c];
    int lgg=1<<lgc;
    lgc++;
    int M=max(max(m[a][b][lgc], m[a][b+c-lgg][lgc]), max(m[a+c-lgg][b][lgc], m[a+c-lgg][b+c-lgg][lgc]));
    printf("%i\n", M);
    }
}

int main()
{
    read();
    pre();
    query();

    return 0;
}