#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
ifstream in("plantatie.in");
ofstream out("plantatie.out");
int d[505][505][10],n,m;
int main()
{
    in>>n>>m;
    for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++)
            in>>d[i][j][0];
    for(int k=1;(1<<k)<=n;k++)
        for(int i=1;i+(1<<k)-1<=n;i++)
        for(int j=1;j+(1<<k)-1<=n;j++)
        {
            int m1=max(d[i][j][k-1],d[i+(1<<(k-1))][j+(1<<(k-1))][k-1]);
            int m2=max(d[i+(1<<(k-1))][j][k-1],d[i][j+(1<<(k-1))][k-1]);
            d[i][j][k]=max(m1,m2);
        }
    for(int i=1;i<=m;i++)
    {
        int x,y,l;
        in>>x>>y>>l;
        int p=log2(l);
        int m1=max(d[x][y][p],d[x+l-(1<<p)][y][p]);
        int m2=max(d[x][y+l-(1<<p)][p],d[x+l-(1<<p)][y+l-(1<<p)][p]);
        out<<max(m1,m2)<<'\n';
    }

    return 0;
}