#include <bits/stdc++.h>
#define MAX_N 501
using namespace std;
ifstream fin("plantatie.in");
ofstream fout("plantatie.out");
int RMQ[19][MAX_N][MAX_N];
int E[100001];
int n,m;

int main()
{
    fin>>n>>m;
    for(int i = 2; i<=n; i++)
        E[i] = 1+E[i/2];
    for(int i = 1; i<=n; i++)
        for(int j = 1; j<=n; j++)
            fin>>RMQ[0][i][j];
    for(int p = 1; (1<<p) <= n; p++){
        for(int i = 1; i<=n; i++){
            for(int j = 1; j<=n; j++){
                RMQ[p][i][j] = RMQ[p-1][i][j];
                int k1 = i + ((1<<p)>>1);
                int k2 = j + ((1<<p)>>1);
                if(k1 <= n && RMQ[p-1][k1][j] > RMQ[p][i][j])
                    RMQ[p][i][j] = RMQ[p-1][k1][j];
                if(k2 <= n && RMQ[p-1][i][k2] > RMQ[p][i][j])
                    RMQ[p][i][j] = RMQ[p-1][i][k2];
                if((k1 <= n && k2 <=n) && RMQ[p-1][k1][k2] > RMQ[p][i][j])
                    RMQ[p][i][j] = RMQ[p-1][k1][k2];
            }
        }
    }
    int x,y,lat;
    for(int i = 1; i<=m; i++){
        fin>>x>>y>>lat;
        int e = E[lat];
        int p = 1<<e;
        fout<<max(max(RMQ[e][x][y],RMQ[e][x][y + lat - p]), max(RMQ[e][x + lat - p][y],RMQ[e][x + lat - p][y + lat - p]))<<'\n';

    }
    return 0;
}