#include <cstdio>
#include <algorithm>
using namespace std;

const int MAXN = 501;

int n, q, mat[MAXN][MAXN], d[31][MAXN][MAXN], ap[MAXN], x, y, z, p, doi[32], xp, yp;

int main()
{
    int i, j, k;
    freopen ("plantatie.in", "r", stdin);
    freopen ("plantatie.out", "w", stdout);
    for(i = 0; i <= 31; ++i)
        doi[i] = (1 << i);
    scanf("%d %d", &n, &q);
    for(i = 1; i <= n; ++i) {
        for(j = 1; j <= n; ++j) {
            scanf(" %d ", &mat[i][j]);
            d[0][i][j] = mat[i][j];
        }
    }
    for(i = 1; doi[i] <= n; ++i)
        for(j = 1; j <= n; ++j)
            for(k = 1; k <= n; ++k)
                d[i][j][k] = max(max(d[i - 1][j][k], d[i - 1][j][k + doi[i - 1]]), max(d[i - 1][j + doi[i - 1]][k], d[i - 1][j + doi[i - 1]][k + doi[i - 1]]));
    ap[1] = 0;
    for(i = 2; i <= 500; ++i)
        ap[i] = ap[i / 2] + 1;
    for(i = 1; i <= q; ++i) {
        scanf("%d %d %d", &x, &y, &z);
        xp = x + z - 1;
        yp = y + z - 1;
        p = ap[z];
        printf("%d\n", max(max(d[p][x][y], d[p][x][yp - doi[p] + 1]), max(d[p][xp - doi[p] + 1][y], d[p][xp - doi[p] + 1][yp - doi[p] + 1])));
    }
    return 0;
}