#include <bits/stdc++.h>
using namespace std;
ifstream fin("plantatie.in");
ofstream fout("plantatie.out");
int n,n_query;
int x,y,z;
//arr[p][i][j]
int arr[27][501][501];
int E[100100];
int len,e;

int main()
{
    fin>>n>>n_query;
    for(int i = 1; i<=n; i++){
        for(int j = 1; j<=n; j++){
            fin>>arr[0][i][j];
        }
    }
    for(int p = 1,lat = 2; lat<=n; lat*=2,p++){
        for(int i = 1; i<=n; i++){
            for(int j = 1; j<=n; j++){
                arr[p][i][j] = arr[p-1][i][j];
                int k1 = i + (lat >> 1);
                int k2 = j + (lat >> 1);
                if(k1 <= n && arr[p-1][k1][j] > arr[p][i][j])
                    arr[p][i][j] = arr[p-1][k1][j];
                if(k2 <= n && arr[p-1][i][k2] > arr[p][i][j])
                    arr[p][i][j] = arr[p-1][i][k2];
                if((k1 <= n && k2 <=n) && arr[p-1][k1][k2] > arr[p][i][j])
                    arr[p][i][j] = arr[p-1][k1][k2];
            }
        }
    }
    E[1] = 0;
    for(int i = 2; i<=n; i++)
        E[i] = 1 + E[i/2];
    for(int i = 1; i<=n_query; i++){
        fin>>x>>y>>z;
        e = E[z];
        len = (1<<e);
        int x1 = x + z - len;
        int y1 = y + z - len;
        fout<<max(max(arr[e][x1][y],arr[e][x1][y1]) ,max(arr[e][x][y],arr[e][x][y1]))<<'\n';
    }
    return 0;
}