#include <iostream>
#include <string>
#include <algorithm> 
#include <vector>
#include <map>
#include <set>
#include <utility>
#include <queue>
#include <stack>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <iomanip>
#include <cassert>
#include <memory.h>
#include <functional>
#include <bitset>
#include <unordered_map>
#include <unordered_set>
#include <climits>
#include <list>
#include <numeric>
#include <iterator>
#include <sstream>
#include <fstream>
#include <complex>
#include <valarray>
#include <typeinfo>
#include <functional>
#include <random>
#include <chrono>
#include <cassert>
#include <array>
#include <regex>
#include <tuple>



template <typename T>
struct DSU {
  std::vector<T> f, siz;
  DSU(int n) : f(n), siz(n, 1) { std::iota(f.begin(), f.end(), 0); }
  T leader(T x) {
    while (x != f[x]) x = f[x] = f[f[x]];
    return x;
  }
  bool same(T x, T y) { return leader(x) == leader(y); }
  bool merge(T x, T y) {
    x = leader(x);
    y = leader(y);
    if (x == y) return false;
    siz[x] += siz[y];
    f[y] = x;
    return true;
  }
  T size(int x) { return siz[leader(x)]; }
  void clear() {
    std::fill(siz.begin(), siz.end(), 1);
    std::iota(f.begin(), f.end(), 0);
  }
};

int main() {
    int n,m;
    std::cin >> n >> m;
    std::vector<std::vector<int>> g(n, std::vector<int>(m));
    int mx = 0;
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            std::cin >> g[i][j];
            mx = std::max(mx, g[i][j]);
        }
    }
    std::vector<std::tuple<int, int, int>> edges;
    auto convert = [&](int x, int y) -> int {
        return x * m + y;
    };

    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            if (i + 1 < n) {
                edges.emplace_back(std::max(g[i][j], g[i + 1][j]), convert(i, j), convert(i + 1,j));
            } 
            if (j + 1 < m ) {
                edges.emplace_back(std::max(g[i][j], g[i][j + 1]), convert(i, j), convert(i, j + 1));
            }
        }
    }
    std::sort(edges.begin(), edges.end());
    int q;
    std::cin >> q;
    DSU<int> dsu(n * m);    

    
    for (int i = 0; i < q; i++) {
        int a,b,c,d;
        std::cin >> a >> b >> c >> d;
        a--, b--, c--, d--;
        int l = 0, r = mx;
        auto check = [&](int less) -> bool {
            std::unordered_set<int> st;
            for (auto& [w, u, v] : edges) {
                if (w > less) {
                    for (int x : st) {
                        dsu.f[x] = x;
                        dsu.siz[x] = 1;
                    }
                    return false;
                }
                dsu.merge(u, v);
                st.insert(u);
                st.insert(v);
                if (dsu.same(convert(a, b), convert(c, d))) {
                    for (int x : st) {
                        dsu.f[x] = x;
                        dsu.siz[x] = 1;
                    }
                    return true;
                }
            }
            return false;
        };
        while(l < r) {
            int mid = (l + r) / 2;
            if (check(mid)) r = mid;
            else l = mid + 1;
        }
        std::cout << l << '\n';
    }
}