#include <bits/stdc++.h>
using namespace std;
ifstream fin("plantatie.in");
ofstream fout("plantatie.out");

int main() {
    int n, m;
    fin>>n>>m;
    int a[501][501];
    for(int i = 1; i<=n; ++i)
        for(int j = 1; j<=n; ++j)
            fin>>a[i][j];
    int x, y, k, maxim;
    for(int t = 0; t<m; ++t) {
        fin>>x>>y>>k;
        maxim = 0;
        for(int i = x; i<x+k; ++i)
            for(int j = y; j<y+k; ++j)
                maxim = max(maxim, a[i][j]);
        fout<<maxim<<endl;
    }
    return 0;
}