#include<bits/stdc++.h>
using namespace std;
ifstream f("plantatie.in");
ofstream g("plantatie.out");

int n, m, rmq[20][501][501], v[501];

int main()
{
    f>>n>>m;

    for(int i=1;i<=n;++i)
        for(int j=1;j<=n;++j)
            f>>rmq[0][i][j];

    for(int i=2;i<=n;++i)
        v[i]=1+v[i/2];

    for(int i=1;(1<<i)<=n;++i)
        for(int j=1;j+((1<<i)-1)<=n;++j)
            for (int k=1;k+((1<<i)-1)<=n;++k)
                rmq[i][j][k] = max(max(rmq[i-1][j][k], rmq[i-1][j][k+(1<<(i-1))]), max(rmq[i-1][j+(1<<(i-1))][k], rmq[i-1][j+(1<<(i-1))][k+(1<<(i-1))]));

    for(int i=1;i<=m;++i)
    {
        int x,y,z;
        f>>x>>y>>z;
        g<<max(max(rmq[v[z]][x][y], rmq[v[z]][x][y+z-(1<<v[z])]), max(rmq[v[z]][x+z-(1<<v[z])][y], rmq[v[z]][x+z-(1<<v[z])][y+z-(1<<v[z])]))<<'\n';
    }

    return 0;
}