#include <fstream>
using namespace std;
ifstream fin("plantatie.in");
ofstream fout("plantatie.out");

int r[10][502][502], E[502];
int n, q;

int main(){
    fin >> n >> q;
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= n; j++){
            fin >> r[0][i][j];
        }
    }

    for(int p = 1, len = 2; len <= n; p++, len *= 2){
        for(int i1 = 1; i1 <= n - len + 1; i1++){
            for(int j1 = 1; j1 <= n - len + 1; j1++){
                int i2 = i1 + (len >> 1);
                int j2 = j1 + (len >> 1);
                r[p][i1][j1] = max(max(r[p-1][i1][j1], r[p-1][i1][j2]), max(r[p-1][i2][j1], r[p-1][i2][j2]));
            }
        }
    }

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

    while(q--){
        int i1, j1, i2, j2, k;
        fin >> i1 >> j1 >> k;
        int e = E[k];
        int len = (1 << e);
        i2 = i1 + k - len;
        j2 = j1 + k - len;
        fout << max(max(r[e][i1][j1], r[e][i1][j2]), max(r[e][i2][j1], r[e][i2][j2])) << '\n';
    }

    fin.close();
    fout.close();
    return 0;
}