#include <iostream>
#include <fstream>
using namespace std;

ifstream f("plantatie.in");
ofstream g("plantatie.out");

const int N = 500,
          M = 75000;

int n,m;
int r[N+1][N+1][8],v[N+1][N+1];
int log[N*N];
int rez;

int main()
{
    int x,y,k,L;
    f>>n>>m;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            f>>v[i][j];
            r[i][j][0]=v[i][j];
        }
    }

    log[1]=0;
    for(int i=2;i<=n*n;i++){
        log[i]=1+log[i/2];
    }


    // r[i][j] = minim din intervalul [ i- 2^j+1 , i]
    // r[i][j] = v[i] daca j=0
    //           min( r[i][j-1], r[i-(1<<(j-1))][j-1])

    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            for(int k=1;((1 << (k-1)) < i) && ((1 << (k-1)) < j);k++)
                r[i][j][k]= max(max(r[i-(1<<(k-1))][j][k-1],
                                    r[i][j-(1<<(k-1))][k-1]),
                                r[i-(1<<(k-1))][j-(1<<(k-1))][k-1]);
//                cout<<"i:"<<i<<"j:"<<j<<"k:"<<k;
        }
    }



    //return 0;

    for(int i=1;i<=m;i++){
        f>>x>>y>>k;

        L=log[k*k];

        //rez=max(r[y][L],r[x+(1<<L)-1][L]);
        rez=max(max(max(r[x+(1<<L)-1][y+k-1][L],
                        r[x+k-1][y+(1<<L)-1][L]),
                    r[x+(1<<L)-1][y+(1<<L)-1][L]),
                r[x+k-1][y+k-1][L]
                );

        g<<rez<<'\n';

    }
    return 0;
}