#include <iostream>
#include <fstream>
using namespace std;



int main(){
    int n, m;
    ifstream fin("plantatie.in");
    ofstream fout("plantatie.out");
    fin >> n >> m;
    int teren[n+1][n+1];
    for( int i = 1; i <= n; i++ ){
        for( int j = 1; j <= n; j++ ){
            int x;
            fin >> x;
            teren[i][j] = x;
        }
    }
    for( int x = 0; x < m; x++ ){
        int i, j, k;
        fin >> i >> j >> k;
        int max = -1;
        for( int ii = i; ii < i+k; ii++ ){
            for( int jj = j; jj < j+k; jj++ ){
                if( teren[ii][jj] > max ) max = teren[ii][jj];
            }
        }
        fout << max << endl;
    }
}