#include <bits/stdc++.h>
using namespace std;
ifstream in("plantatie.in");
ofstream out("plantatie.out");
int tree[10][505][505];
int n,q,x,y,l;
int lg[505];
void rmq()
{
    for(int i=2;i<=n;++i)
        lg[i]=lg[i/2]+1;
    for(int p=1;p<=lg[n];++p)
    for(int i=1;i+(1<<p)-1<=n;++i)
    for(int j=1;j+(1<<p)-1<=n;++j)
    tree[p][i][j]=max({tree[p-1][i][j],tree[p-1][i+(1<<(p-1))][j],
                      tree[p-1][i][j+(1<<(p-1))],tree[p-1][i+(1<<(p-1))][j+(1<<(p-1))]});
}
void answer(int x,int y,int l)
{
    int k=lg[l];
    out<<max({tree[k][x][y],tree[k][x+l-(1<<k)][y],
                          tree[k][x][y+l-(1<<k)],tree[k][x+l-(1<<k)][y+l-(1<<k)]})<<'\n';
}
int main()
{
    in>>n>>q;
    for(int i=1;i<=n;++i)
    for(int j=1;j<=n;++j)
        in>>tree[0][i][j];
    rmq();
    while(q--)
    {
        in>>x>>y>>l;
        answer(x,y,l);
    }
    return 0;
}