#include<bits/stdc++.h>
#pragma GCC optimize("Ofast,unroll-loops,inline")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define setinf(x) memset(x,0x3f3f3f3f,sizeof(x));
#define set0(x) memset(x,0,sizeof(x));
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define INF 0x3f3f3f3f
#define vi vector<int>
#define ll long long
#define vll vector<ll>
#define pb push_back
#define fi first
#define se second
#define DD 100001
#define nl '\n'
using namespace std;
const string file="plantatie";
ifstream f(file+".in");
ofstream g(file+".out");
//#define f cin
//#define g cout
struct SparseTable2D {
    const int LG=10;
    int n,m;
    vector<vector<vector<int>>>v;
    SparseTable2D(int _n, int _m, vector<vector<int>>&a) {
        n=_n,m=_m;
        v.resize(n+1,vector(m+1,vector(LG+1,0)));
        for (int i=1; i<=n; ++i) {
            for (int j=1; j<=m; ++j) {
                v[i][j][0]=a[i][j];
            }
        }
        for (int k=1; k<=LG; ++k) {
            for (int i=1; i+(1<<k)-1<=n; ++i) {
                for (int j=1; j+(1<<k)-1<=m; ++j) {
                    v[i][j][k]=max({
                        v[i][j][k-1],
                        v[i+(1<<(k-1))][j+(1<<(k-1))][k-1],
                        v[i+(1<<(k-1))][j][k-1],
                        v[i][j+(1<<(k-1))][k-1]
                    });
                }
            }
        }
    }
    int query(int x1, int y1, int x2, int y2) {
        int l1=__lg(x2-x1+1);
        int m1=max(v[x1][y1][l1],v[x2-(1<<l1)+1][y1][l1]);
        int m2=max(v[x1][y2-(1<<l1)+1][l1],v[x2-(1<<l1)+1][y2-(1<<l1)+1][l1]);
        return max(m1,m2);
    }
};
int n,q;
int main(){
    f>>n>>q;
    vector<vi>v(n+1,vi(n+1));
    for (int i=1; i<=n; ++i) {
        for (int j=1; j<=n; ++j) {
            f>>v[i][j];
        }
    }
    SparseTable2D r(n,n,v);
    while (q--) {
        int x,y,l;
        f>>x>>y>>l;
        g<<r.query(x,y,x+l-1,y+l-1)<<nl;
    }
    system("pause");
    return 0;
}