#include<stdio.h>

#define NMAX 507

int D[NMAX][NMAX][20];
int n, Q, l, Lg[NMAX];

inline int max(int a, int b){
    if(a > b)
        return a;
    return b;
}

int main(){
    freopen("plantatie.in", "r", stdin);
    freopen("plantatie.out", "w", stdout);
    scanf("%d %d", &n, &Q);
    for(int i = 1; i <= n; ++ i)
        for(int j = 1; j <= n; ++ j)
            scanf("%d", &D[i][j][0]);
    Lg[1] = 0;
    for(int i = 2; i <= n; ++ i)
        Lg[i] = Lg[i / 2] + 1;
    for(int k = 1; (1 << k) <= n; ++ k)
        for(int i = 1; i <= n - (1 << k) + 1; ++ i)
            for(int j = 1; j <= n - (1 << k) + 1; ++ j){
                D[i][j][k] = max(D[i][j][k - 1], D[i][j + (1 << (k - 1))][k - 1]);
                D[i][j][k] = max(D[i][j][k],     D[i + (1 << (k - 1))][j][k - 1]);
                D[i][j][k] = max(D[i][j][k],     D[i + (1 << (k - 1))][j + (1 << (k - 1))][k - 1]);
            }
    for(; Q > 0; -- Q){
        int i = 0, j = 0, l = 0, k = 0;
        scanf("%d %d %d", &i, &j, &k);
        l = Lg[k];
        int Ans = D[i][j][l];
        Ans = max(Ans, D[i][j + k - (1 << l)][l]);
        Ans = max(Ans, D[i + k - (1 << l)][j][l]);
        Ans = max(Ans, D[i + k - (1 << l)][j + k - (1 << l)][l]);
        printf("%d\n", Ans);
    }
    return 0;
}