#include <bits/stdc++.h>
#define MAX 250100
#define LOG 21
using namespace std;
ifstream fin("plantatie.in");
ofstream fout("plantatie.out");
int c[MAX][LOG];
int a[MAX];
int n,m,maxim;
int main()
{
    int i,j,k,x,y,kk,ii,st,dr,n1;
    fin>>n>>m;
    n1=n;
    n=n*n;
    for(i=1;i<=n;i++)
        fin>>a[i];
    for(i=1;i<=n;i++)
        c[i][0]=i;
    for(j=1;(1<<j)<=n;j++)
        for(i=1;i+(1<<j)-1<=n;i++)
        if(a[c[i][j-1]]>a[c[i+(1<<(j-1))][j-1]])
            c[i][j]=c[i][j-1];
        else
            c[i][j]=c[i+(1<<(j-1))][j-1];
    for(i=1;i<=m;i++)
    {
        fin>>x>>y>>k;
        st=(x-1)*n1+y;
        dr=st+k-1;
        kk=log2(dr-st+1);
        maxim=-1;
        for(ii=1;ii<=k;ii++)
        {
            maxim=max(maxim,max(a[c[st][kk]],a[c[dr-(1<<kk)+1][kk]]));
            st+=n1;dr+=n1;
        }
        fout<<maxim<<'\n';
    }
    return 0;
}