#include <fstream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <iostream>

using namespace std;


void solve()
{
    ifstream fin("plantatie.in");
    ofstream fout("plantatie.out");

    int n,q,logg,x,y,k;
    fin>>n>>q;
    int a[n][n][int(log2(n))+1];
    for(int i=0; i<n; i++){
        for(int j=0; j<n; j++){
            fin>>a[i][j][0];
        }
    }
    for(int d=1; d<=log2(n); d++){
        for(int i=0; i+(1<<d)-1<n; i++){
            for(int j=0; j+(1<<d)-1<n; j++){
                a[i][j][d]=max(max(a[i][j][d-1],a[i+(1<<(d-1))][j+(1<<(d-1))][d-1]),max(a[i+(1<<(d-1))][j][d-1],a[i][j+(1<<(d-1))][d-1]));
            }
        }
    }
    for(int i=0; i<q; i++){
        x,y,k;
        fin>>x>>y>>k;
        x--,y--;
        logg=log2(k);
        fout<<max(max(a[x][y][logg],a[x+k-(1<<logg)][y+k-(1<<logg)][logg]),max(a[x+k-(1<<logg)][y][logg],a[x][y+k-(1<<logg)][logg]))<<"\n";
    }
}

int main()
{
    solve();
    return 0;
}