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

using i64 = long long;

struct dsu {
    int n;
    vector<int> p, size;
    dsu(int n) : n(n), p(n + 1), size(n + 1, 1) {
        iota(p.begin(), p.end(), 0);
    }
    int find(int x) {
        while(x != p[x]) {
            p[x] = p[p[x]];
            x = p[x];
        }
        return x;
    }
    void merge(int x, int y) {
        int x_fa = find(x), y_fa = find(y);
        if(x_fa != y_fa) {
            p[y_fa] = x_fa;
            size[x_fa] += size[y_fa];
        }
    }
    bool same(int x, int y) {
        return find(x) == find(y);
    }
};

void solve() {
    int n, m;
    cin >> n >> m;

    vector<int> a(n * m);
    for (int i = 0; i < n * m; ++i) {
        cin >> a[i];
    }

    int q;
    cin >> q;

    vector<int> ans(q, -1);
    vector g(n * m, vector<array<int, 2>>());
    for (int i = 0; i < q; ++i) {
        int x1, y1, x2, y2;
        cin >> x1 >> y1 >> x2 >> y2;
        --x1, --y1, --x2, --y2;
        g[x1 * m + y1].push_back({x2 * m + y2, i});
        g[x2 * m + y2].push_back({x1 * m + y1, i});
    }

    vector<int> id(n * m);
    iota(id.begin(), id.end(), 0);

    sort(id.begin(), id.end(), [&] (auto& x, auto& y) {
        return a[x] < a[y];
    });

    array<int, 4> dx{0, 1, 0, -1};
    array<int, 4> dy{1, 0, -1, 0};

    vector p(n * m, vector<int>());
    for (int i = 0; i < n * m; ++i) {
        p[i].push_back(i);
    }
    vector<bool> vis(n * m);
    dsu d(n * m);
    for (auto& x : id) {
        vis[x] = true;
        for (int i = 0; i < 4; ++i) {
            int xx = x / m + dx[i], yy = x % m + dy[i];
            int y = xx * m + yy;
            if (xx >= 0 && xx < n && yy >= 0 && yy < m && vis[y]) {
                int u = d.find(x), v = d.find(y);
                if (u == v) {
                    continue;
                }

                if (p[u].size() > p[v].size()) {
                    swap(u, v);
                }

                for (auto& uu : p[u]) {
                    for (auto& [vv, idx] : g[uu]) {
                        if (d.find(vv) == v && ans[idx] == -1) {
                            ans[idx] = a[x];
                        }
                    }
                    p[v].push_back(uu);
                } 
                d.merge(v, u);
            }
        }
    }

    for (auto& v : ans) {
        cout << v << '\n';
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;
    while(t--) {
        solve();
    }
    return 0;
}