#include <bits/stdc++.h>

using namespace std;
ifstream fin("plantatie.in");
ofstream fout("plantatie.out");
int n,m,a[501][501][11],p[501],x,i,j,k;
int main()
{
    fin >> n >> m;
    for (i=1; i<=n; i++)
        for (j=1; j<=n; j++)
            fin >> a[i][j][0];
    for (i=2; i<=n; i++)
        p[i] = p[i/2]+1;
    for (k=1; (1<<k)<=n; k++)
    {
        x = (1<<(k-1));
        for (i=(1<<k); i<=n; i++)
            for (j=(1<<k); j<=n; j++)
            {
                a[i][j][k] = max(a[i][j][k], a[i][j][k-1]);
                a[i][j][k] = max(a[i][j][k], a[i][j-x][k-1]);
                a[i][j][k] = max(a[i][j][k], a[i-x][j][k-1]);
                a[i][j][k] = max(a[i][j][k], a[i-x][j-x][k-1]);
            }
    }
    for (;m--;)
    {
        fin >> i >> j >> k;
        x = (1<<p[k]);
        int sol = 0;
        sol = max(sol, a[i+x-1][j+x-1][p[k]]);
        sol = max(sol, a[i+x-1][j+k-1][p[k]]);
        sol = max(sol, a[i+k-1][j+x-1][p[k]]);
        sol = max(sol, a[i+k-1][j+k-1][p[k]]);
        fout << sol << "\n";
    }
    return 0;
}