#include <bits/stdc++.h>
using namespace std;
ifstream f("plantatie.in");
ofstream g("plantatie.out");
int main()
{
    int n, m, d[501][501];
    f >> n >> m;

    for(int i = 1; i<= n; i++){
        for(int j = 1; j<= n; j++){
            f >> d[i][j];
        }

    }


    for(int k = 1; k<= m; k++){
        int a,b,c,maxNr;
        f >> a >> b >> c;
        maxNr = d[a][b];
        for(int i = a; i<= a+c-1; i++){
            for(int j = b; j<= b+c-1; j++){
                if(d[i][j] > maxNr) maxNr = d[i][j];
            }
        }
        g << maxNr << "\n";
    }




}