#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)

template<class T> bool chmax(T &a, T b)
{
	if(a<b)
	{
		a = b;
		return true;
	}
	return false;
}
template<class T> bool chmin(T &a, T b)
{
	if(a>b)
	{
		a = b;
		return true;
	}
	return false;
}

vector<int> dx = {1,0,-1,0};
vector<int> dy = {0,1,0,-1};
int H, W, a, b, c, d;
bool in(int h, int w)
{
	return (0<=h && h<H && 0<=w && w<W);
}
using P = pair<int,int>;
int main()
{
	cin >> H >> W;
	vector<vector<int>> A(H, vector<int>(W));
	rep(i,H) rep(j,W) cin >> A[i][j];
	int mx = 0;
	rep(i,H) rep(j,W) chmax(mx, A[i][j]);
	auto f = [&](int x) -> bool {
		if(A[a][b]>x || A[c][d]>x) return false;
		queue<P> q;
		q.push({a,b});
		vector<bitset<500>> seen(H);
		while(!q.empty())
		{
			auto [h,w] = q.front();
			q.pop();
			seen[h][w] = 1;
			rep(t,4)
			{
				int nh = h+dx[t];
				int nw = w+dy[t];
				if(in(nh,nw) && !seen[nh][nw] && A[nh][nw]<=x)
				{
					if(nh==c && nw==d) return true;
					q.push({nh,nw});
				}
			}
		}
		return seen[c][d];
	};
	int Q;
	cin >> Q;
	while(Q--)
	{
		cin >> a >> b >> c >> d;
		a--;
		b--;
		c--;
		d--;
		int l = 0;
		int r = mx;
		while(r-l>1)
		{
			int mid = (l+r)/2;
			if(f(mid)) r = mid;
			else l = mid;
		}
		cout << r << '\n';
	}
}