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

int main(){
	int n, m, qn;
	cin >> n >> m >> qn;
	vector<vector<int>> h(n, vector<int>(m));
	int mini=INT_MAX;
	for(vector<int>& x : h){
		for(int& y : x){
			cin >> y;
			mini=min(mini, y);
		}
	}
	vector<vector<int>> res(n, vector<int>(m, INT_MAX));
	priority_queue<array<int, 3>, vector<array<int, 3>>, greater<array<int, 3>>> pq;
	for(int i=0;i<n;i++){
		for(int j=0;j<m;j++){
			if(h[i][j]==mini){ pq.push({h[i][j], i, j}); mini=INT_MIN;}
		}
	}
	while(!pq.empty()){
		auto [v, x, y]=pq.top();
		pq.pop();
		res[x][y]=v;
		if(0<x && res[x-1][y]==INT_MAX) pq.push({max(v, h[x-1][y]), x-1, y});
		if(x+1<n && res[x+1][y]==INT_MAX) pq.push({max(v, h[x+1][y]), x+1, y});
		if(0<y && res[x][y-1]==INT_MAX) pq.push({max(v, h[x][y-1]), x, y-1});
		if(y+1<m && res[x][y+1]==INT_MAX) pq.push({max(v, h[x][y+1]), x, y+1});
	}
	for(int i=0;i<qn;i++){
		int a, b, c, d;
		cin >> a >> b >> c >> d;
		//cout << h[a-1][b-1] << ' ' << res[a-1][b-1] << ' ' << res[c-1][d-1] << '\n';
		cout << max(h[a-1][b-1], max(res[a-1][b-1], res[c-1][d-1])) << '\n';
	}
	return 0;
}