#include <fstream>
#include <iostream>
using namespace std;

int N,M, a[500][500], dp[500][500][500];

int main(){
    ifstream in("plantatie.in");
    ofstream out("plantatie.out");
    in >> N >> M;

    int i,j,k,x,y;

    for (i=1; i<=N; i++)
        for (j=1; j<=N; j++)
            in >> dp[i][j][1];


    for (k=2; k<=N; k++)
        for (i=1; i+k-1<=N; i++)
            for (j=1; j+k-1<=N; j++)
                dp[i][j][k]=max(max(dp[i][j][k-1],dp[i+1][j][k-1]),max(dp[i][j+1][k-1],dp[i+1][j+1][k-1]));

    for (i=1; i<=M; i++){
        in >> x >> y >> k;
        out << dp[x][y][k] << "\n";
    }
    return 0;
}