#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
ifstream f("plantatie.in");
ofstream g("plantatie.out");
int a[10][501][501], n, m, x, y, l;
int main()
{
    f>>n>>m;
    for(int i=1; i<=n; ++i){
        for(int j=1; j<=n; ++j)
                f>>a[0][i][j];
    }
    for(int k=1; (1<<k)<=n; ++k)
        for(int i=1; i<=n; ++i)
            for(int j=1; j<=n; ++j){
                x=min(i+(1<<(k-1)), n);
                y=min(j+(1<<(k-1)), n);
                a[k][i][j]=max(max(a[k-1][i][j], a[k-1][i][y]), max(a[k-1][x][j], a[k-1][x][y]));
            }
        while(m--){
            f>>x>>y>>l;
            int k=log2(l), e=l-(1<<k);
            g<<max(max(a[k][x][y], a[k][x+e][y]), max(a[k][x][y+e], a[k][x+e][y+e]))<<'\n';
        }

    return 0;
}