#include <bits/stdc++.h>
#define NMAX 505
#define LGMAX 10

using namespace std;

ifstream fin("plantatie.in");
ofstream fout("plantatie.out");

int n,m,i,j,k;
int rmq[LGMAX][NMAX][NMAX],loga[NMAX];

int query(int x, int y,int lat) {
    int l,t1,t2,t3,t4;
    l=loga[lat];
    lat--;
    int x1=x+lat;
    int y1=y+lat;

    t1=rmq[l][x][y];
    t2=rmq[l][x1-(1<<l)+1][y];
    t3=rmq[l][x][y1-(1<<l)+1];
    t4=rmq[l][x1-(1<<l)+1][y1-(1<<l)+1];
    return max(max(t1,t2),max(t3,t4));
}

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

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

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

    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++) {
                rmq[log][i][j] = max(max(rmq[log-1][i][j],rmq[log-1][i+(1<<(log-1))][j]),
                                    max(rmq[log-1][i][j+(1<<(log-1))],rmq[log-1][i+(1<<(log-1))][j+(1<<(log-1))]));
            }
        }
    }

    for(int i=1;i<=m;i++) {
        int x,y,l;
        fin>>x>>y>>l;
        fout<<query(x,y,l)<<'\n';
    }
    return 0;
}