#line 1 "cp_templates/template/template.hpp"
# include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const double pi = acos(-1);
template<class T>constexpr T inf() { return ::std::numeric_limits<T>::max(); }
template<class T>constexpr T hinf() { return inf<T>() / 2; }
template <typename T_char>T_char TL(T_char cX) { return tolower(cX); }
template <typename T_char>T_char TU(T_char cX) { return toupper(cX); }
template<class T> bool chmin(T& a,T b) { if(a > b){a = b; return true;} return false; }
template<class T> bool chmax(T& a,T b) { if(a < b){a = b; return true;} return false; }
int popcnt(unsigned long long n) { int cnt = 0; for (int i = 0; i < 64; i++)if ((n >> i) & 1)cnt++; return cnt; }
int d_sum(ll n) { int ret = 0; while (n > 0) { ret += n % 10; n /= 10; }return ret; }
int d_cnt(ll n) { int ret = 0; while (n > 0) { ret++; n /= 10; }return ret; }
ll gcd(ll a, ll b) { if (b == 0)return a; return gcd(b, a%b); };
ll lcm(ll a, ll b) { ll g = gcd(a, b); return a / g*b; };
ll MOD(ll x, ll m){return (x%m+m)%m; }
ll FLOOR(ll x, ll m) {ll r = (x%m+m)%m; return (x-r)/m; }
template<class T> using dijk = priority_queue<T, vector<T>, greater<T>>;
# define all(qpqpq)           (qpqpq).begin(),(qpqpq).end()
# define UNIQUE(wpwpw)        (wpwpw).erase(unique(all((wpwpw))),(wpwpw).end())
# define LOWER(epepe)         transform(all((epepe)),(epepe).begin(),TL<char>)
# define UPPER(rprpr)         transform(all((rprpr)),(rprpr).begin(),TU<char>)
# define rep(i,upupu)         for(ll i = 0, i##_len = (upupu);(i) < (i##_len);(i)++)
# define reps(i,opopo)        for(ll i = 1, i##_len = (opopo);(i) <= (i##_len);(i)++)
# define len(x)                ((ll)(x).size())
# define bit(n)               (1LL << (n))
# define pb push_back
# define exists(c, e)         ((c).find(e) != (c).end())

struct INIT{
	INIT(){
		std::ios::sync_with_stdio(false);
		std::cin.tie(0);
		cout << fixed << setprecision(20);
	}
}INIT;

namespace mmrz {
	void solve();
}

int main(){
	mmrz::solve();
}
#line 2 "2786.cpp"
// #include "./cp_templates/template/debug.hpp"
// #define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
// #define debug(...) (static_cast<void>(0))

#line 1 "cp_templates/data_structure/union_find.hpp"

struct union_find {
	vector<int> v;
	int g_size;

	union_find(size_t size) : v(size, -1), g_size(size) {}

	int root(int x){
		return (v[x] < 0 ? x : v[x] = root(v[x]));
	}

	bool is_root(int x){
		return root(x) == x;
	}

	bool unite(int x, int y){
		x = root(x);
		y = root(y);
		if(x != y){
			if(v[x] > v[y])swap(x, y);
			v[x] += v[y];
			v[y] = x;
			g_size--;
			return true;
		}
		return false;
	}

	bool is_same(int x,int y){
		return root(x) == root(y);
	}

	int get_size(int x){
		x = root(x);
		return -v[x];
	}

	int groups_size(){
		return g_size;
	}
};
#line 7 "2786.cpp"

using namespace mmrz;

void SOLVE(){
	int h, w;
	cin >> h >> w;
	vector<vector<int>> a(h, vector<int>(w));
	vector<vector<pair<int, int>>> e(h*w+1);
	rep(i, h)rep(j, w){
		cin >> a[i][j];
		e[a[i][j]].pb({i, j});
	}
	int q;
	cin >> q;
	vector<int> rs(q), cs(q), rt(q), ct(q);
	rep(i, q){
		cin >> rs[i] >> cs[i] >> rt[i] >> ct[i];
		rs[i]--, cs[i]--, rt[i]--, ct[i]--;
	}

	auto within = [&](int y, int x) -> bool {
		return 0 <= y && y < h && 0 <= x && x < w;
	};
	int dy[] = {1, 0, -1, 0};
	int dx[] = {0, 1, 0, -1};
	
	vector<int> ng(q, 0), ok(q, h*w+1);
	rep(_, 20){
		map<int, vector<int>> judge;
		rep(i, q)judge[(ng[i]+ok[i])/2].pb(i);
		union_find uf(h*w);
		rep(cst, h*w+1){
			for(auto [y, x] : e[cst]){
				rep(dir, 4){
					int ny = y+dy[dir];
					int nx = x+dx[dir];
					if(not within(ny, nx))continue;
					if(cst < a[ny][nx])continue;
					uf.unite(y*w+x, ny*w+nx);
				}
			}
			for(auto idx : judge[cst]){
				(uf.is_same(rs[idx]*w+cs[idx], rt[idx]*w+ct[idx]) ? ok[idx] : ng[idx]) = cst;
			}
		}
	}
	rep(i, q){
		cout << ok[i] << endl;
	}
}

void mmrz::solve(){
	int t = 1;
	//cin >> t;
	while(t--)SOLVE();
}