#include <bits/stdc++.h>
using namespace std;

int lg[510], rmq[510][510][10],n,m,x,y,l,j;

int main()
{
    ifstream cin("plantatie.in");
    ofstream cout("plantatie.out");
    lg[1]=0;
    cin>>n>>m;
    for(int i=0;i<n;i++)
    {
        for(int j=0;j<n;j++)
        {
            cin>>rmq[i][j][0];
        }

        //if(i) lg[i] = lg[i/2]+1;
    }
    for(int i=2;i<=512;i++)
        lg[i] = lg[i/2]+1;

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

    while(m--)
    {
        cin>>x>>y>>l;
        x--;y--;
        int k = lg[l];
        cout<<max(max(rmq[x][y][k], rmq[x+l - (1<<(k))][y][k]), max(rmq[x][y+l-(1<<(k))][k], rmq[x+l-(1<<(k))][y+l-(1<<(k))][k]))<<'\n';
    }

    return 0;
}