*cornfields <pku 2019>

 // 二维 rmq .
// author : gssn
// date   : 5.17
#include <iostream>
#include <cmath>
using namespace std;
int maxx[255][255][8],minn[255][255][8],f[255][255];
int n,b,kk;
void init()
{
    int len = int(log(double(n)) / log(2.0));
    for(int k=1;k<=len;k++)
    {
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j+(1<<(k-1))-1<=n;j++)
            {
                maxx[i][j][k] = max(maxx[i][j][k-1],maxx[i][j+(1<<(k-1))][k-1]);
                minn[i][j][k] = min(minn[i][j][k-1],minn[i][j+(1<<(k-1))][k-1]);
            }
        }
    }
}
int query_(int a,int c,int len)
{
    int x=-1,y=1000;
    for(int i=a;i<a+b;i++){
        x = max(x,max(maxx[i][c][len],maxx[i][c+b-(1<<len)][len]));
        y = min(y,min(minn[i][c][len],minn[i][c+b-(1<<len)][len]));
    }
    return x - y;
}
int main()
{
    int a,c;
    cin>>n>>b>>kk;
    for(int i=1;i<=n;i++)
    for(int j=1;j<=n;j++)
    {
        cin>>f[i][j];
        maxx[i][j][0]=minn[i][j][0]=f[i][j];
    }
    int len = int(log(double(b)) / log(2.0));
    init();
    while(kk--)
    {
        cin>>a>>c;
        cout<< query_(a,c,len) <<endl;
    }
    return 0;
}