#include<iostream>
#include<cstdlib>
#include<sstream>
#include<cstdio>
#include<stack>
#include<cstdio>
#include<map>
#include<set>
#include<queue>
#include<cstring>
#include<cmath>
#include<vector>
#include<math.h>
#include<algorithm>
#define REP(i,a,b) for(int i=a;i<b;i++)
#define REPP(i,a,b) for(int i=a;i<=b;i++)
#define inf 0x3f3f3f3f
using namespace std;
const int maxn=255;
int Fmax[maxn][maxn][20];//第k行[i,i+2^j-1]区间的最大值
int Fmin[maxn][maxn][20];
int a[maxn][maxn];
int lb[maxn];
int n,b,k;
void Initlog()
{
lb[0]=-1;
REP(i,1,maxn)
{
lb[i]=(i&(i-1))?lb[i-1]:(lb[i-1]+1);
}
}
void ST(int n)
{
REPP(k,1,n)
{
REPP(i,1,n)
{
Fmax[k][i][0]=Fmin[k][i][0]=a[k][i];
}
}
REPP(k,1,n)
{
REPP(j,1,lb[n])
{
REPP(i,1,(n-(1<<j)+1))
{
Fmax[k][i][j]=max(Fmax[k][i][j-1],Fmax[k][i+(1<<(j-1))][j-1]);
Fmin[k][i][j]=min(Fmin[k][i][j-1],Fmin[k][i+(1<<(j-1))][j-1]);
}
}
}
}
void solve(int x,int y,int b)//从坐标(x,y)开始,向下扩展b长度
{
int k=lb[b];
int maxx=-1;
int minx=inf;
int l=y,r=y+b-1;//相当于[l,r]区间
REP(i,x,x+b)
{
maxx=max(maxx,max(Fmax[i][l][k],Fmax[i][r-(1<<k)+1][k]));
minx=min(minx,min(Fmin[i][l][k],Fmin[i][r-(1<<k)+1][k]));
}
printf("%d\n",maxx-minx);
}
int x,y;
int main()
{
scanf("%d%d%d",&n,&b,&k);
REPP(i,1,n)
{
REPP(j,1,n)
{
scanf("%d",&a[i][j]);
}
}
Initlog();
ST(n);
REPP(i,1,k)
{
scanf("%d%d",&x,&y);
solve(x,y,b);
}
return 0;
}
额,刚开始数组第二维开大了MLE了