#include <iostream>
#include <fstream>

using namespace std;

ifstream in("plantatie.in");
ofstream out("plantatie.out");

const int N = 501;
const int LIN = 9;
int r[LIN][N][N], a[N][N], log[N],n, m;

int max(int a, int b, int c, int d)
{
    return max(max(a,b), max(c,d));
}

int main()
{
    log[1] = 0;
    for(int i=2; i<=n; i++)
        log[i] = 1 + log[i/2];

    in>>n>>m;
    for(int i=0; i<n; i++)
        for(int j=0; j<n; j++)
            in>>r[0][i][j];

    /*
    for(int i=0; i<n; i++)
    {
        for(int j=0; j<n; j++)
            cout<<r[0][i][j]<<' ';
        cout<<'\n';
    }
    */

    for(int l=1; l<=log[n]; l++)
        for(int i=0; i<=n-(1<<(l-1)); i++)
            for(int j=0; j<=n-(1<<(l-1)); j++)
            {
                r[l][i][j] = max(r[l-1][i][j], r[l-1][i][j+(1<<(l-1))], r[l-1][i+(1<<(l-1))][j], r[l-1][i+(1<<(l-1))][j+(1<<(l-1))]);
            }


    for(int i=1; i<=m; i++)
    {
        int i1, j1, i2, j2, lat;
        in>>i1>>j1>>lat;
        i1--;
        j1--;
        int l = log[lat];
        i2 = i1+lat-1;
        j2 = j1+lat-1;
        int ans = max(r[l][i1][j1], r[l][i1][j2-(1<<l)+1], r[l][i2-(1<<l)+1][j1], r[l][i2-(1<<l)+1][j2-(1<<l)+1]);
        out<<ans<<'\n';
    }
    return 0;
}