#include <bits/stdc++.h>
using namespace std;
ifstream in("plantatie.in");
ofstream out("plantatie.out");
int v[505][505];
int rmq[505][505][21];
int p2[505];
int pow2[25];
int n, m;
void citire()
{
    in >> n >> m;
    for(int i = 1; i <= n; i ++)
        for(int j = 1; j <= n; j ++)
            in >> v[i][j];
}

void buildrmq()
{
    p2[1] = 0;
    pow2[0] = 1;
    pow2[1] = 2;
    for(int i = 2; i <= n; i ++)
        p2[i] = p2[i / 2] + 1;
    for(int i = 2; i <= 20; i ++)
        pow2[i] = 2 * pow2[i - 1];
    for(int i = 1; i <= n; i ++)
        for(int j = 1; j <= n; j ++)
            rmq[i][j][0] = v[i][j];
    for(int k = 1; k <= p2[n]; k ++)
    {
        int p = pow2[k - 1];
        for(int i = 1; i + p <= n; i ++)
        {
            for(int j = 1; j + p <= n; j ++)
                rmq[i][j][k] = max(max(max(rmq[i][j][k - 1], rmq[i + p][j][k - 1]), rmq[i][j + p][k - 1]), rmq[i + p][j + p][k - 1]);
        }
    }
}

int query(int i, int j, int k)
{
    int p = p2[k];
    int mx = rmq[i][j][p];
    mx = max(mx, rmq[i][j + k - pow2[p]][p]);
    mx = max(mx, rmq[i + k - pow2[p]][j][p]);
    mx = max(mx, rmq[i + k - pow2[p]][j + k - pow2[p]][p]);
    return mx;
}

void solve()
{
    while(m)
    {
        int a, b, c, mx = 0;
        in >> a >> b >> c;
        out << query(a, b, c) << '\n';
        m --;
    }
}
int main()
{
    citire();
    buildrmq();
    solve();
    return 0;
}