#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
ifstream in ("plantatie.in");
ofstream out("plantatie.out");
int n, m, r[501][501][10], rez;

void init_rmq() {
        for (int k = 1; k <= 9; k++) {
                for (int i = 1; i <= n - (1 << k) + 1; i++) {
                        for (int j = 1; j <= n - (1 << k) + 1; j++) {
                                r[i][j][k] = max(r[i][j][k - 1],
                                             max(r[i][j + (1 << (k - 1))][k - 1],
                                             max(r[i + (1 << (k - 1))][j][k - 1],
                                                 r[i + (1 << (k - 1))][j + (1 << (k - 1))][k - 1])));
                        }
                }
        }
}

int query(int a, int b, int c) {
        int p = log2(c);
        return max(r[a][b][c],
               max(r[a][b + c - (1 << p)][p],
               max(r[a + c - (1 << p)][b][p], r[a + c - (1 << p)][b + c - (1 << p)][p])));
}

int main() {
        in >> n >> m;
        // A[i][j][k]=maximul din submatricea (i,j) de lat (1<<k)
        for (int i = 1; i <= n; i++) {
                for (int j = 1; j <= n; j++) {
                        in >> r[i][j][0];
                }
        }

        init_rmq();

        int x, y, z;
        for (int t = 1; t <= m; t++) {
                in >> x >> y >> z;
                out << query(x, y, z) << "\n";
        }
        return 0;
}