#include<iostream>
#include<cstdio>
#include<string.h>
#include<string>
#include<stack>
#include<set>
#include<algorithm>
#include<cmath>
#include<vector>
#include<map>
#define ll __int64
#define lll unsigned long long
#define MAX 1000009
#define eps 1e-8
#define INF 0xfffffff
using namespace std;
/*
查询
*/
int mapp[309][309];
int dp1[309][309][9][9];
int dp2[309][309][9][9];
int flag;
void RMQ_init2d(int m,int n)
{
for(int i=1; i<=m; i++)
{
for(int j = 1; j<=n; j++)
{
dp1[i][j][0][0] = mapp[i][j];
}
}
int t = log((double)n) / log(2.0);
for(int i = 0; i<=t; i++)
{
for(int j = 0; j<=t; j++)
{
if(i==0&&j==0)
continue;
for(int row = 1; row+(1<<i)-1<= m; row++)
{
for(int col = 1; col+(1<<j)-1<= n; col++)
{
if(i)
dp1[row][col][i][j] = max(dp1[row][col][i-1][j],dp1[row+(1<<(i-1))][col][i-1][j]);
else
dp1[row][col][i][j] = max(dp1[row][col][i][j-1],dp1[row][col+(1<<(j-1))][i][j-1]);
}
}
}
}
}
int RMQ_2d(int x1,int y1,int x2,int y2)
{
int k1 = log(double(x2 - x1 + 1)) / log(2.0);
int k2 = log(double(y2 - y1 + 1)) / log(2.0);
int m1 = dp1[x1][y1][k1][k2];
int m2 = dp1[x2 - (1<<k1) + 1][y1][k1][k2];
int m3 = dp1[x1][y2 - (1<<k2) + 1][k1][k2];
int m4 = dp1[x2 - (1<<k1) + 1][y2 - (1<<k2) + 1 ][k1][k2];
int _max = max(max(m1,m2),max(m3,m4));
return _max;
}
void RMQ_init3d(int m,int n)
{
for(int i=1; i<=m; i++)
{
for(int j = 1; j<=n; j++)
{
dp2[i][j][0][0] = mapp[i][j];
}
}
int t = log((double)n) / log(2.0);
for(int i = 0; i<=t; i++)
{
for(int j = 0; j<=t; j++)
{
if(i==0&&j==0)
continue;
for(int row = 1; row+(1<<i)-1<= m; row++)
{
for(int col = 1; col+(1<<j)-1<= n; col++)
{
if(i)
dp2[row][col][i][j] = min(dp2[row][col][i-1][j],dp2[row+(1<<(i-1))][col][i-1][j]);
else
dp2[row][col][i][j] = min(dp2[row][col][i][j-1],dp2[row][col+(1<<(j-1))][i][j-1]);
}
}
}
}
}
int RMQ_3d(int x1,int y1,int x2,int y2)
{
int k1 = log(double(x2 - x1 + 1)) / log(2.0);
int k2 = log(double(y2 - y1 + 1)) / log(2.0);
int m1 = dp2[x1][y1][k1][k2];
int m2 = dp2[x2 - (1<<k1) + 1][y1][k1][k2];
int m3 = dp2[x1][y2 - (1<<k2) + 1][k1][k2];
int m4 = dp2[x2 - (1<<k1) + 1][y2 - (1<<k2) + 1 ][k1][k2];
int _min = min(min(m1,m2),min(m3,m4));
return _min;
}
int main()
{
int n,m,t;
int a,b;
int x1,x2,y1,y2;
while(~scanf("%d%d%d",&m,&n,&t))
{
for(int i = 1; i<=m; i++)
{
for(int j = 1; j<=m; j++)
{
scanf("%d",&mapp[i][j]);
}
}
RMQ_init2d(m,m);
RMQ_init3d(m,m);
while(t--)
{
//scanf("%d%d%d%d",&x1,&y1,&x2,&y2);
scanf("%d%d",&a,&b);
//cout<<a<<" "<<b<<endl;
x1 = a;
y1 = b;
x2 = a+n-1;
y2 = b+n-1;
//cout<<x1<<" "<<y1<<" "<<x2<<" "<<y2<<endl;
int _max = RMQ_2d(x1,y1,x2,y2);
int _min = RMQ_3d(x1,y1,x2,y2);
// cout<<_min<<endl;
printf("%d\n",_max-_min);
}
}
return 0;
}
#include<cstdio>
#include<string.h>
#include<string>
#include<stack>
#include<set>
#include<algorithm>
#include<cmath>
#include<vector>
#include<map>
#define ll __int64
#define lll unsigned long long
#define MAX 1000009
#define eps 1e-8
#define INF 0xfffffff
using namespace std;
/*
二维RMQ模板
同一维一样 用dp1[row][col][i][j]表示(row,col)到(row+2^i,col+2^j)矩形内的最大值
查询
*/
int mapp[309][309];
int dp1[309][309][9][9];
int dp2[309][309][9][9];
int flag;
void RMQ_init2d(int m,int n)
{
for(int i=1; i<=m; i++)
{
for(int j = 1; j<=n; j++)
{
dp1[i][j][0][0] = mapp[i][j];
}
}
int t = log((double)n) / log(2.0);
for(int i = 0; i<=t; i++)
{
for(int j = 0; j<=t; j++)
{
if(i==0&&j==0)
continue;
for(int row = 1; row+(1<<i)-1<= m; row++)
{
for(int col = 1; col+(1<<j)-1<= n; col++)
{
if(i)
dp1[row][col][i][j] = max(dp1[row][col][i-1][j],dp1[row+(1<<(i-1))][col][i-1][j]);
else
dp1[row][col][i][j] = max(dp1[row][col][i][j-1],dp1[row][col+(1<<(j-1))][i][j-1]);
}
}
}
}
}
int RMQ_2d(int x1,int y1,int x2,int y2)
{
int k1 = log(double(x2 - x1 + 1)) / log(2.0);
int k2 = log(double(y2 - y1 + 1)) / log(2.0);
int m1 = dp1[x1][y1][k1][k2];
int m2 = dp1[x2 - (1<<k1) + 1][y1][k1][k2];
int m3 = dp1[x1][y2 - (1<<k2) + 1][k1][k2];
int m4 = dp1[x2 - (1<<k1) + 1][y2 - (1<<k2) + 1 ][k1][k2];
int _max = max(max(m1,m2),max(m3,m4));
return _max;
}
void RMQ_init3d(int m,int n)
{
for(int i=1; i<=m; i++)
{
for(int j = 1; j<=n; j++)
{
dp2[i][j][0][0] = mapp[i][j];
}
}
int t = log((double)n) / log(2.0);
for(int i = 0; i<=t; i++)
{
for(int j = 0; j<=t; j++)
{
if(i==0&&j==0)
continue;
for(int row = 1; row+(1<<i)-1<= m; row++)
{
for(int col = 1; col+(1<<j)-1<= n; col++)
{
if(i)
dp2[row][col][i][j] = min(dp2[row][col][i-1][j],dp2[row+(1<<(i-1))][col][i-1][j]);
else
dp2[row][col][i][j] = min(dp2[row][col][i][j-1],dp2[row][col+(1<<(j-1))][i][j-1]);
}
}
}
}
}
int RMQ_3d(int x1,int y1,int x2,int y2)
{
int k1 = log(double(x2 - x1 + 1)) / log(2.0);
int k2 = log(double(y2 - y1 + 1)) / log(2.0);
int m1 = dp2[x1][y1][k1][k2];
int m2 = dp2[x2 - (1<<k1) + 1][y1][k1][k2];
int m3 = dp2[x1][y2 - (1<<k2) + 1][k1][k2];
int m4 = dp2[x2 - (1<<k1) + 1][y2 - (1<<k2) + 1 ][k1][k2];
int _min = min(min(m1,m2),min(m3,m4));
return _min;
}
int main()
{
int n,m,t;
int a,b;
int x1,x2,y1,y2;
while(~scanf("%d%d%d",&m,&n,&t))
{
for(int i = 1; i<=m; i++)
{
for(int j = 1; j<=m; j++)
{
scanf("%d",&mapp[i][j]);
}
}
RMQ_init2d(m,m);
RMQ_init3d(m,m);
while(t--)
{
//scanf("%d%d%d%d",&x1,&y1,&x2,&y2);
scanf("%d%d",&a,&b);
//cout<<a<<" "<<b<<endl;
x1 = a;
y1 = b;
x2 = a+n-1;
y2 = b+n-1;
//cout<<x1<<" "<<y1<<" "<<x2<<" "<<y2<<endl;
int _max = RMQ_2d(x1,y1,x2,y2);
int _min = RMQ_3d(x1,y1,x2,y2);
// cout<<_min<<endl;
printf("%d\n",_max-_min);
}
}
return 0;
}