#include <iostream>
#include <vector>
#include <algorithm>
#include <limits>
#include <numeric>
#include <cstring>
#include <string>
#include <queue>
#include <set>
#include <cmath>
#include <fstream>
#include <cstdlib>
#include <map>
#define pb push_back
#define mp make_pair
#define INF numeric_limits<int>::max()
#define bit(x) (-x)&x
#define int64 long long
using namespace std;
ifstream in("plantatie.in");
ofstream out("plantatie.out");
int RMQ[11][555][555],lg[555],n,q;
int main()
{
    in>>n>>q;
    for(int i=1;i<=n;i++)
    for(int j=1;j<=n;j++)
        in>>RMQ[0][i][j];
    for(int i=2;i<=n;i++)
        lg[i]=lg[i/2]+1;
    for(int i=1;(1<<i)<=n;i++)
    for(int j=1;j<=n-(1<<i)+1;j++)
    for(int k=1;k<=n-(1<<i)+1;k++)
        RMQ[i][j][k]=max( max(RMQ[i-1][j][k],RMQ[i-1][j+(1<<(i-1))][k+(1<<(i-1))]) , max(RMQ[i-1][j+(1<<(i-1))][k],RMQ[i-1][j][k+(1<<(i-1))]) );
    for(;q;q--)
    {
        int x,y,k;
        in>>x>>y>>k;
        int diff=k-(1<<lg[k]);
        k=lg[k];
        out<<max( max(RMQ[k][x][y],RMQ[k][x+diff][y+diff]) , max(RMQ[k][x+diff][y],RMQ[k][x][y+diff]) )<<'\n';
    }
    return 0;
}