#include <fstream>
#include <deque>
#define MAX 1002

using namespace std;
ifstream fin ("struti.in");
ofstream fout ("struti.out");
int mat[MAX][MAX];
int mind[MAX][MAX];
int maxd[MAX][MAX];
int n,m;
typedef struct {
    int diff,ap;
} strut;
strut solve (int x, int y) {
    for (int lin=0; lin<n; lin++) {
        deque<int> dmin, dmax;
        for (int col=0; col<m; col++) {
            while (!dmin.empty() && mat[lin][dmin.back()]>=mat[lin][col]) {
                dmin.pop_back();
            }
            dmin.push_back(col);
            if (dmin.front()<=col-y) {
                dmin.pop_front();
            }
            while (!dmax.empty() && mat[lin][dmax.back()]<=mat[lin][col]) {
                dmax.pop_back();
            }
            dmax.push_back(col);
            if (dmax.front()<=col-y) {
                dmax.pop_front();
            }
            if (col>=y-1) {
                mind[lin][col-y+1]=mat[lin][dmin.front()];
                maxd[lin][col-y+1]=mat[lin][dmax.front()];
            }
        }
    }
    int maxim=2e9;
    int cnt=0;
    for (int col=0; col<m-y+1; col++) {
        deque<int> dmin, dmax;
        for (int lin=0; lin<n; lin++) {
            while (!dmin.empty() && mind[dmin.back()][col]>=mind[lin][col]) {
                dmin.pop_back();
            }
            dmin.push_back(lin);
            if (dmin.front()<=lin-x) {
                dmin.pop_front();
            }
            while (!dmax.empty() && maxd[dmax.back()][col]<=maxd[lin][col]) {
                dmax.pop_back();
            }
            dmax.push_back(lin);
            if (dmax.front()<=lin-x) {
                dmax.pop_front();
            }
            if (lin>=x-1) {
                int diff=maxd[dmax.front()][col]-mind[dmin.front()][col];
                if (diff<maxim) {
                    maxim=diff;
                    cnt=1;
                } else if (diff==maxim) {
                    cnt++;
                }
            }
        }
    }
    return {maxim, cnt};
}
int main() {
    int p,x,y,lin,col,i;
    fin>>n>>m>>p;
    for (lin=0; lin<n; lin++) {
        for (col=0; col<m; col++) {
            fin>>mat[lin][col];
        }
    }
    for (i=0; i<p; i++) {
        fin>>x>>y;
        strut r1=solve(x, y);
        if (x!=y) {
            strut r2=solve(y, x);
            if (r1.diff < r2.diff) {
                fout<<r1.diff<<" "<<r1.ap<<endl;
            } else if (r2.diff<r1.diff) {
                fout<<r2.diff<<" "<<r2.ap<<endl;
            } else {
                fout<<r1.diff<<" "<<r1.ap+r2.ap<<endl;
            }
        } else {
            fout<<r1.diff <<" "<<r1.ap<<endl;
        }
    }
    return 0;
}