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

using namespace std;

int rmq[502][502][20];
int lg[1026];

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 + p2k;
                nj = j + p2k;
                rmq[i][j][k] = max( max(rmq[i][j][k-1], rmq[ni][j][k-1]), max(rmq[ni][nj][k-1], rmq[i][nj][k-1]) );
            }
    }
    int p2 = 2;
    int k = 2;
    int l2 = 0;
    lg[1] = 0;
    while (1)
    {
        p2 *= 2;
        l2++;
        for (; k < p2 && k <= n; k++)
            lg[k] = l2;
        if (p2 > n)
            break;
    }


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

    return 0;
}