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

template <class T> struct Kruskal_dsu {
    public:
    Kruskal_dsu() : _n(0) {}
    Kruskal_dsu(int n) : _n(n), parent_or_size(n, -1), 
                         dat(n, std::numeric_limits<T>::max()) {}
    bool merge(int u, int v, T w) {
        assert(0 <= u && u < _n);
        assert(0 <= v && v < _n);
        int x = leader(u), y = leader(v);
        if (x == y) return false;
        if (-parent_or_size[x] < -parent_or_size[y]) std::swap(x, y);
        parent_or_size[x] += parent_or_size[y];
        parent_or_size[y] = x;
        dat[y] = w;
        return true;
    }
    int leader(int v) {
        assert(0 <= v && v < _n);
        while(parent_or_size[v] >= 0) v = parent_or_size[v];
        return v;
    }
    T max_edge(int u, int v){
        T ans = 0;
        while(u != v){
            if (dat[u] > dat[v]) std::swap(u, v);
            ans = dat[u], u = parent_or_size[u];
            if(u < 0) return -1;
        }
        return ans;
    }
    private:
    int _n;
    std::vector<int> parent_or_size;
    std::vector<T> dat;
};

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int h, w, Q;
    cin >> h >> w;
    Kruskal_dsu<int> uf(h * w);
    vector<int> pre(w), cur(w);
    vector<tuple<int,int,int>> edge;
    edge.reserve((1 << 18) - 1);
    auto f = [&](int y, int x) {return y * w + x;};
    for(int x = 0; x < w; x++){
        cin >> pre[x];
        if(x) edge.emplace_back(max(pre[x], pre[x - 1]), x - 1, x);
    }
    for(int y = 1; y < h; y++){
        for(int x = 0; x < w; x++){
            cin >> cur[x];
            edge.emplace_back(max(cur[x], pre[x]), (y - 1) * w + x, y * w + x);
            if(x) edge.emplace_back(max(cur[x], cur[x - 1]), y * w + x - 1, y * w + x);
        }
        swap(pre, cur);
    }
    sort(edge.begin(), edge.end());
    for(auto &&[w, u, v] : edge) uf.merge(u, v, w);
    cin >> Q;
    while(Q--){
        int sy, sx, ty, tx;
        cin >> sy >> sx >> ty >> tx;
        sy--, sx--, ty--, tx--;
        cout << uf.max_edge(sy * w + sx, ty * w + tx) << '\n';
    }
}