#include <bits/stdc++.h>
#define NMAX 520
#define LGMAX 11

using namespace std;

ifstream fin("plantatie.in");
ofstream fout("plantatie.out");
int n,m;
int rmq[LGMAX][NMAX][NMAX];
int loga[NMAX];

int query(int x,int y,int l) {
    int nivel=loga[l];
    int x1=x+l-1;
    int y1=y+l-1;

    int putere=(-(1<<nivel)+1);
    int t1=rmq[nivel][x][y];
    int t2=rmq[nivel][x1-(1<<nivel)+1][y];
    int t3=rmq[nivel][x][y1-(1<<nivel)+1];
    int t4=rmq[nivel][x1-(1<<nivel)+1][y1-(1<<nivel)+1];

    return max(max(t1,t2),max(t3,t4));
}

int main()
{
    fin>>n>>m;

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

    for(int i=1;i<=n;i++) {
        for(int j=1;j<=n;j++) {
            fin>>rmq[0][i][j];
        }
    }

    for(int log=1;(1<<log)<=n;log++) {
        for(int i=1;i+(1<<log)-1<=n;i++) {
            for(int j=1;j+(1<<log)-1<=n;j++) {
                int putere=(1<<(log-1));
                rmq[log][i][j]=max( max(rmq[log-1][i+putere][j], rmq[log-1][i][j]),
                                         max(rmq[log-1][i][j+putere],rmq[log-1][i+putere][j+putere]));
            }
        }
    }
    for(int i=1;i<=m;i++) {
        int x,y,l;
        fin>>x>>y>>l;
        fout<<query(x,y,l)<<'\n';
    }
    return 0;
}