#include <bits/stdc++.h>

using namespace std;

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

const int NMAX = 500 + 5;
int twoPower[11], mat[NMAX][NMAX][11], n, m;

int bin_search(int left, int right, int value){
    int solution = 0;

    while(left <= right){
        int mid = left + (right - left) / 2;

        if(twoPower[mid] <= value) solution = mid, left = mid + 1;
        else right = mid - 1;
    }

    return solution;
}

int main(){

//    ifstream f("D:/Proiecte/Clion/Projects/hashuri.in");
//    ofstream g("D:/Proiecte/Clion/Projects/hashuri.out");

    for(int i = 0; i < 10; ++i)
        twoPower[i] = (1 << i);

    f >> n >> m;

    for(int i = 0; i < n; ++i)
        for(int j = 0; j < n; ++j)
            f >> mat[i][j][0];

    int lg = bin_search(0, 10, n);

    for(int k = 1; k <= lg; ++k)
        for(int i = 0; i + (1 << k) - 1 < n; ++i)
            for(int j = 0; j + (1 << k) - 1 < n; ++j)
                mat[i][j][k] = max({mat[i][j][k - 1],
                                    mat[i + (1 << (k - 1))][j][k - 1],
                                    mat[i][j + (1 << (k - 1))][k - 1],
                                    mat[i + (1 << (k - 1))][j + (1 << (k - 1))][k - 1]});

    for(int k = 1; k <= m; ++k){
        int left, right, l_size;
        f >> left >> right >> l_size;

        --left; --right;

        int aux_lg = bin_search(0, 10, l_size);

        g << max({mat[left][right][aux_lg],
                  mat[left][right + l_size - (1 << aux_lg)][aux_lg],
                  mat[left + l_size - (1 << aux_lg)][right][aux_lg],
                  mat[left + l_size - (1 << aux_lg)][right + l_size - (1 << aux_lg)][aux_lg]}) << '\n';
    }

    f.close();
    g.close();

    return 0;
}