#include<stdio.h>
int n,m,min,nr;
int v[1<<10][1<<10],v1[1<<10][1<<10],v2[1<<10][1<<10],v3[1<<10][1<<10],v4[1<<10][1<<10],deq[1<<10];

void rez(int dx, int dy)
{
	//v1[i][j]=min ult dy elem de pe linia i si ult elem j
	int p=1,u=0,i,j;
	for(i=1;i<=n;i++)
	{
		p=1;u=0;
		for(j=1;j<=m;j++)
		{
			while(p<=u && v[i][j]<v[i][deq[u]])
				u--;
			deq[++u]=j;
			if(deq[p]+dx<=j)
				p++;
			v1[i][j]=(j>=dx)?v[i][deq[p]]:0;
		}
	}
	//v2[i][j]=max ult dy elem de pe linia i si ult elem j
	for(i=1;i<=n;i++)
	{
		p=1;u=0;
		for(j=1;j<=m;j++)
		{
			while(p<=u && v[i][j]>v[i][deq[u]])
				u--;
			deq[++u]=j;
			if(deq[p]+dx<=j)
				p++;
			v2[i][j]=(j>=dx)?v[i][deq[p]]:0;
		}
	}
	//v1[i][j]=min ult dy elem de pe linia i si ult elem j
	for(j=dx;j<=m;j++)
	{
		p=1;u=0;
		for(i=1;i<=n;i++)
		{
			while(p<=u && v1[i][j]<v1[deq[u]][j])
				u--;
			deq[++u]=i;
			if(deq[p]+dy<=i)
				p++;
			v3[i][j]=(i>=dy)?v1[deq[p]][j]:0;
		}
	}
	//v1[i][j]=min ult dy elem de pe linia i si ult elem j
	for(j=dx;j<=m;j++)
	{
		p=1;u=0;
		for(i=1;i<=n;i++)
		{
			while(p<=u && v2[i][j]>v2[deq[u]][j])
				u--;
			deq[++u]=i;
			if(deq[p]+dy<=i)
				p++;
			v4[i][j]=(i>=dy)?v2[deq[p]][j]:0;
		}
	}
	for(i=dy;i<=n;i++)
		for(j=dx;j<=m;j++)
			if(v4[i][j]-v3[i][j]<min)
			{
				min=v4[i][j]-v3[i][j];
				nr=1;
			}
			else
				if(v4[i][j]-v3[i][j]==min)
					nr++;
}

int main()
{
	freopen("struti.in","r",stdin);
	freopen("struti.out","w",stdout);
	int k,dx,dy;
	scanf("%d%d%d",&n,&m,&k);
	int i,j;
	for(i=1;i<=n;i++)
		for(j=1;j<=m;j++)
			scanf("%d",&v[i][j]);
	while(k--)
	{
		scanf("%d%d",&dx,&dy);
		min=1<<30;nr=0;
//		rez(dx,dy);
//		if(dx-dy)
//			rez(dy,dx);
		printf("%d %d\n",min,nr);
	}
	return 0;
}