#include<bits/stdc++.h>
#define N 505
using namespace std;

int d[N][N][710];
int n,q;

int main() {
    ifstream cin("plantatie.in");
    ofstream cout("plantatie.out");
    cin>>n>>q;

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

    for (int k=2; k<=n; ++k) {
        for (int i=1; i<=n && i+k-1<=n; ++i) {
            for (int j=1; j<=n && j+k-1<=n; ++j) {
                    d[i][j][k]=max(max(d[i][j][k-1],d[i+1][j][k-1]), max(d[i][j+1][k-1], d[i+1][j+1][k-1]));
            }
        }
    }

    while (q--) {
        int x,y,k; cin>>x>>y>>k;
        cout<<d[x][y][k]<<'\n';
    }


    return 0;
}