#include <cstdio>
#include <cmath>
#include <algorithm>

using namespace std;

int rmq[502][502][20];

int main()
{
    freopen("plantatie.in", "r", stdin);
    freopen("plantatie.out", "w", stdout);

    int n, m;
    scanf("%d%d", &n, &m);
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= n; j++)
            scanf("%d", &rmq[i][j][0]);

    int ni, nj;
    int l2n = log2(n);
    int p2k;
    for (int k = 1; k <= l2n; k++)
    {
        p2k = 1<<(k-1);
        for (int i = 1; i <= n-p2k+1; i++)
            for (int j = 1; j <= n-p2k+1; j++)
            {
                ni = i + (1<<(k-1));
                nj = j + ni - i;
                rmq[i][j][k] = rmq[i][j][k-1];
                rmq[i][j][k] = max(rmq[i][j][k], rmq[ni][j][k-1]);
                rmq[i][j][k] = max(rmq[i][j][k], rmq[ni][nj][k-1]);
                rmq[i][j][k] = max(rmq[i][j][k], rmq[i][nj][k-1]);
            }
    }

    int x, y, k;
    int t, l;
    while (m--)
    {
        scanf("%d%d%d", &x, &y, &k);
        l = log2(k-1);
        t = max(rmq[x][y][l], rmq[x+k-(1<<l)][y][l]);
        t = max(t, rmq[x][y+k-(1<<l)][l]);
        t = max(t, rmq[x+k-(1<<l)][y+k-(1<<l)][l]);
        printf("%d\n", t);
    }

    return 0;
}