#include <fstream>
#include <iomanip>
#include <string>
#include <stdio.h>
#include <vector>
#include <algorithm>
#include <math.h>
#include <set>
#include <map>
#include <string.h>
#include <queue>
#include <stack>

#define INF 0x3f3f3f3f

#define MAXN 505
#define MAXL 9

int rmq[MAXL][MAXN][MAXN];
int lg[MAXN];

using namespace std;

#ifdef DEBUG
string name = "data";
#else
string name = "plantatie";
#endif

ifstream fin(name + ".in");
ofstream fout(name + ".out");

int n, q;

void buildTable() {
    int lim = lg[n];
    for (int k = 1; k <= lim; ++k) {
        int nlim = n - (1 << k) + 1;
        int nxt = 1 << (k - 1);
        for (int i = 1; i <= nlim; ++i) {
            for (int j = 1; j <= nlim; ++j) {
                rmq[k][i][j] = max(rmq[k - 1][i][j], rmq[k - 1][i + nxt][j + nxt]);
            }
        }
    }
}

int query(int x, int y, int k) {
    int lim = lg[k];
    
    int nd1 = (x + k) - (1 << lim);
    int nd2 = (y + k) - (1 << lim);
    
    int v1 = max(rmq[lim][x][y], rmq[lim][nd1][nd2]);
    int v2 = max(rmq[lim][nd1][y], rmq[lim][x][nd2]);
    
    return max(v1, v2);
}

int main() {
    
    fin >> n >> q;
    
    int nxt = 2;
    int v = 0;
    
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= n; ++j) {
            int x;
            fin >> x;
            rmq[0][i][j] = x;
        }
        if (i == nxt) {
            v++;
            nxt *= 2;
        }
        lg[i] = v;
    }
    
    buildTable();

    for (int i = 0; i < q; ++i) {
        int x, y, k;
        fin >> x >> y >> k;
        fout << query(x, y, k) << "\n";
    }
    
    return 0;
}