#include <fstream>
#include <vector>
#include <algorithm>
#include <cmath>

std::ifstream cin("plantatie.in");
std::ofstream cout("plantatie.out");

const int MAXN = 505;
const int MAX_LOG = 9;  // log2(512) < 9

int st[MAXN][MAXN][MAX_LOG];
int a[MAXN][MAXN];
int n, m;

void build_sparse_table() {

    // Preprocesarea pentru submatricile pătratice de dimensiuni 2^k x 2^k
    for (int k = 1; (1 << k) <= n; k++) {
        for (int i = 1; i + (1 << k) - 1 <= n; i++) {
            for (int j = 1; j + (1 << k) - 1 <= n; j++) {
                int prev_k = k - 1;
                st[i][j][k] = std::max({
                    st[i][j][prev_k],
                    st[i + (1 << prev_k)][j][prev_k],
                    st[i][j + (1 << prev_k)][prev_k],
                    st[i + (1 << prev_k)][j + (1 << prev_k)][prev_k]
                });
            }
        }
    }
}

int query(int x1, int y1, int len) {
    int k = log2(len);
    int x2 = x1 + len - 1;
    int y2 = y1 + len - 1;
    return std::max({
        st[x1][y1][k],
        st[x2 - (1 << k) + 1][y1][k],
        st[x1][y2 - (1 << k) + 1][k],
        st[x2 - (1 << k) + 1][y2 - (1 << k) + 1][k]
    });
}

int main() {
    /// citire matrice
    cin >> n >> m;
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= n; ++j) {
            cin >> st[i][j][0];
        }
    }

    build_sparse_table();

    for (int i = 1; i <= m; ++i) {
        int x1, y1, len;
        cin >> x1 >> y1 >> len;
        cout << query(x1, y1, len) << '\n';
    }

    return 0;
}