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

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

int main(){
    int n,q;
    fin>>n>>q;

    vector<int> log(n+1);

    log[1] = 0;

    for(int i=2;i<=n;i++)
        log[i] = log[i/2]+1;


    vector<vector<int>> v(n+1,vector<int>(n+1));
    vector<vector<vector<int>>> rmq(n+1,vector<vector<int>>(n+1,vector<int>(log[n]+1)));

    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            fin>>v[i][j];
            rmq[i][j][0] = v[i][j];
        }
    }

    int s = 2;
    for(int k=1;k<=log[n];k++){
        for(int i=1;i<=n;i++){
            if(i + s - 1> n)
                break;

            for(int j=1;j<=n;j++){
               if(j + s - 1> n)
                 break;

               rmq[i][j][k] = max({rmq[i][j][k-1],rmq[i+s/2][j][k-1],rmq[i][j+s/2][k-1],rmq[i+s/2][j+s/2][k-1]});
            }
        }
        s *= 2;
    }

    for(int t=1;t<=q;t++){
        int i,j,k;
        fin>>i>>j>>k;
        int len = 1 << log[k];
        int p = log[k];

        fout<<max({rmq[i][j][p],rmq[i+len/2][j][p],rmq[i][j+len/2][p],rmq[i+len/2][j+len/2][p]})<<"\n";
    }
}