#include <cstdio>
#include <cstring>
#include <algorithm>
#define maxN 502
#define maxL 10
using namespace std;
int n, k, m, d[maxL][maxN][maxN], p, Log[maxN];
void read()
{
    int i, j;
    scanf("%d %d\n", &n, &m);
    for (i = 1; i <= n; ++ i)
        for (j = 1; j <= n; ++ j)
        {
            scanf("%d", &d[0][i][j]);
        }

    for (i = 2; i <= n; ++ i)
        Log[i] = Log[i / 2] + 1;
}
void solve()
{
    int i, j, k;
    for (k = 1; 1 << k <= n; ++ k)
        for (i = 1; i <= n; ++ i)
            for (j = 1; j <= n; ++ j)
                if ( i + (1 << k) - 1 <= n && j + (1 << k) - 1 <= n)
                {
                    p = 1 << (k - 1);
                    d[k][i][j] = max(max(d[k - 1][i][j], d[k - 1][i + p][j + p]), max(d[k - 1][i][j + p], d[k - 1][i + p][j]));
                }
}
void write()
{
    int x, y, sol;
    while (m --)
    {
        scanf("%d %d %d", &x, &y, &k);
        p = Log[k];
        sol = max(d[p][x][y], max(d[p][x + k - (1 << p)][y + k - (1 << p)], max(d[p][x + k - (1 << p)][y], d[p][x][y + k - (1 << p)])));
        printf("%d\n", sol);
    }
}
int main()
{
    freopen("plantatie.in", "r", stdin);
    freopen("plantatie.out", "w", stdout);
    read();
    solve();
    write();
    return 0;
}