//		2019-----------------CornFields
#include<stdio.h>
int main(void)
{
	int n,b,k;
	int square[251][251],maxArray[251][251],minArray[251][251],answers[1001];
	int i,j,m,l,upRow,leftColumn;
	scanf("%d %d %d",&n,&b,&k);
	for (i=1;i<=n;i++)
		for (j=1;j<=n;j++)
		{
			scanf("%d",&square[i][j]);
		}
	for (i=1;i<=n-b+1;i++)
		for (j=1;j<=n-b+1;j++)
		{
			maxArray[i][j]=-1;
			minArray[i][j]=251;
		}
	for (i=1;i<=n-b+1;i++)
		for (j=1;j<=n-b+1;j++)
			for (m=i;m<=i+b-1;m++)
				for (l=j;l<=j+b-1;l++)
				{
					if (square[m][l]<minArray[i][j]) minArray[i][j]=square[m][l];
					if (square[m][l]>maxArray[i][j]) maxArray[i][j]=square[m][l];
				}
	for (i=1;i<=k;i++)
	{
		scanf("%d %d",&upRow,&leftColumn);
		printf("%d\n",maxArray[upRow][leftColumn]-minArray[upRow][leftColumn]);
	}
}