#include <bits/stdc++.h>
#include <atcoder/dsu>
using namespace std;
using namespace atcoder;

int IDX(int i, int j, int W) {
    return i*W+j;
}

int main() {
    int H, W, Q;
    cin >> H >> W;
    vector<vector<int>> A(H, vector<int>(W));
    for (int i=0; i<H; i++) {
        for (int j=0; j<W; j++) {
            cin >> A[i][j];
        }
    }
    cin >> Q;
    vector<vector<int>> query(Q, vector<int>(4));
    for (int i=0; i<Q; i++) {
        for (int j=0; j<4; j++) {
            cin >> query[i][j];
        }
    }

    vector<tuple<int, int, int>> edge;
    for (int i=0; i<H; i++) {
        for (int j=0; j<W; j++) {
            if (i+1 < H) {
                edge.emplace_back(max(A[i][j], A[i+1][j]), IDX(i, j, W), IDX(i+1, j, W));
            }
            if (j+1 < W) {
                edge.emplace_back(max(A[i][j], A[i][j+1]), IDX(i, j, W), IDX(i, j+1, W));
            }
        }
    }
    sort(edge.begin(), edge.end());

    vector<int> left(Q, 0);
    vector<int> right(Q, edge.size());
    vector<vector<int>> mid(edge.size()+1);
    for (int i=0; i<Q; i++) {
        mid[edge.size()/2].push_back(i);
    }

    int cnt = 0;
    while (cnt < Q) {
        dsu UF(H*W);
        for (int i=0; i<=edge.size(); i++) {
            if (!mid[i].empty()) {
                while (!mid[i].empty()) {
                    int idx = mid[i].back();
                    mid[i].pop_back();
                    if (UF.same(IDX(query[idx][0]-1, query[idx][1]-1, W), IDX(query[idx][2]-1, query[idx][3]-1, W))) {
                        right[idx] = i;
                    } else {
                        left[idx] = i;
                    }
                    if (left[idx]+1 == right[idx]) {
                        cnt ++;
                    } else {
                        mid[(left[idx]+right[idx])/2].push_back(idx);
                    }
                }
            }
            if (i < edge.size()) {
                UF.merge(get<1>(edge[i]), get<2>(edge[i]));
            }
        }
    }

    for (int i=0; i<Q; i++) {
        cout << get<0>(edge[left[i]]) << endl;
    }
}