#include <fstream>
#include <cmath>
using namespace std;
ifstream cin("plantatie.in");
ofstream cout("plantatie.out");
const int maxn=505;
int rmq[10][maxn][maxn];
int n,m;
int V[maxn];
int main()
{
    cin>>n>>m;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            cin>>rmq[0][i][j];
        }
    }
    int log=log2(n)+1;
    for(int k=1;k<=log;k++){
        int p=pow(2,k-1);
        for(int i=1;i<=n;i++){
            for(int j=1;j<=n;j++){
                rmq[k][i][j]=max(max(rmq[k-1][i][j],rmq[k-1][i][j+p]),max(rmq[k-1][i+p][j],rmq[k-1][i+p][j+p]));
            }
        }
    }
    for(int w=1;w<=m;w++){
        int i,j,k;
        cin>>i>>j>>k;
        int lg=log2(k);
        int p=pow(2,lg);
        cout<<max(max(rmq[lg][i][j],rmq[lg][i][j+k-1-p+1]),max(rmq[lg][i+k-1-p+1][j],rmq[lg][i+k-1-p+1][j+k-1-p+1]))<<'\n';
    }
    return 0;
}