#include <cstdio>
#include <deque>
using namespace std;

const int N = 1000;
const int M = 1000;

int n,m,p;
int a[N][M];
deque<int> dmin[N],dmax[N];

int main() {
	freopen("struti.in","rt",stdin);
	freopen("struti.out","wt",stdout);
	scanf("%d %d %d",&n,&m,&p);
	for (int i = 0; i < n; ++i) {
		for (int j = 0; j < m; ++j) {
			scanf("%d",&a[i][j]);
		}
	}
	for (int k = 0; k < p; ++k) {
		scanf("%d %d",&dx,&dy);
		int min1,p1,min2,p2;
		scan(dx,dy,min1,p1);
		scan(dx,dy,min2,p2);
		if (min1 == min2) p1 *= p2; else
		if (min2 < min1) min1 = min2, p1 = p2;
		printf("%d %d\n",min1,p1);
	}
	return 0;
}