//2022tysc0819
#include<bits/stdc++.h>
//#include<bits/extc++.h>
using namespace std;
//using namespace __gnu_pbds;
//#define int long long
//#define double long double
//#define map unordered_map
//#pragma GCC optimize(2,3,"Ofast","inline")
const int N=1e5+10,M=260,P=1e9+7,MOD=998244353;
const double PI=3.1415926,EPS=0.00001;
int n,b,kk,e[M][M],x,y,f[2][M][M][M];
signed main(){
    cin>>n>>b>>kk;
    for(int i=1;i<=n;i++)for(int j=1;j<=n;j++){
        cin>>e[i][j];
        f[0][i][j][1]=e[i][j];
        f[1][i][j][1]=e[i][j];
    }
    for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)for(int k=2;k<=i&&k<=j;k++){
        f[0][i][j][k]=max(-P,f[0][i-1][j-1][k-1]);
        f[0][i][j][k]=max(f[0][i][j][k],f[0][i-1][j][k-1]);
        f[0][i][j][k]=max(f[0][i][j][k],f[0][i][j-1][k-1]);
        f[1][i][j][k]=min(P,f[1][i-1][j-1][k-1]);
        f[1][i][j][k]=min(f[1][i][j][k],f[1][i-1][j][k-1]);
        f[1][i][j][k]=min(f[1][i][j][k],f[1][i][j-1][k-1]);
    }/*
    for(int i=1;i+b-1<=n;i++){for(int j=1;j+b-1<=n;j++){
        cout<<f[0][i+b-1][j+b-1][b]<<"-"<<f[1][i+b-1][j+b-1][b]<<" ";
    }cout<<endl;}*/
    while(kk--){
        cin>>x>>y;
        cout<<f[0][x+b-1][y+b-1][b]-f[1][x+b-1][y+b-1][b]<<endl;
    }
    return 0;
}
//note:

第一次运行：

Accepted 1.465ms 6508KiB

5

第二次运行：

Runtime Error 0.460552ms 128KiB

ExitCode: 11 (Segmentation fault)