#include <fstream>
using namespace std;
ifstream f("plantatie.in");
ofstream g("plantatie.out");
int a[501][501][10],lg[501];
int main()
{
    int n,m;
    f>>n>>m;
    lg[1]=0;
    for(int i=2;i<=500;i++)
        lg[i]=lg[i/2]+1;
    for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++)
            f>>a[i][j][0];
    for(int p=1;(1<<p)<=n;p++)
        for(int i=1;i+(1<<p)-1<=n;i++)
            for(int j=1;j+(1<<p)-1<=n;j++)
                a[i][j][p]=max(max(a[i][j][p-1],a[i+(1<<(p-1))][j][p-1]),
                               max(a[i][j+(1<<(p-1))][p-1],a[i+(1<<(p-1))][j+(1<<(p-1))][p-1]));
    for(int q=1;q<=m;q++)
    {
        int x,y,k;
        f>>x>>y>>k;
        int l=lg[k];
        g<<max(max(a[x][y][l],a[x+k-(1<<l)][y][l]),
                max(a[x][y+k-(1<<l)][l],a[x+k-(1<<l)][y+k-(1<<l)][l]))<<'\n';
    }
    return 0;
}