#include <bits/stdc++.h>
#define MAXN 1000

class deque{
    public:
    short v[1 + MAXN];
    short p = 0, u = -1;

    inline int empty(){
        return p > u;
    }
    inline void push_back(int val){
        v[++u] = val;
    }
    inline void pop_back(){
        if(u >= p)
            u--;
    }
    inline void pop_front(){
        if(p <= u)
            p++;
    }
    inline void clear(){
        p = 0;
        u = -1;
    }
    inline int front(){
        return v[p];
    }
    inline int back(){
        return v[u];
    }
};

#define BUF_SIZE 1 << 14
char buf[BUF_SIZE];
int pbuf=BUF_SIZE;
FILE*fi,*fo;
inline char nextch(){
    if(pbuf==BUF_SIZE){
        fread(buf, BUF_SIZE, 1, fi);
        pbuf=0;
    }
    return buf[pbuf++];
}
inline short nextnum(){
    short a = 0;
    char c = nextch();
    while(!isdigit(c))
        c = nextch();
    while(isdigit(c)){
        a = a * 10 + c - '0';
        c = nextch();
    }
    return a;
}

short m, n;
struct Ans{
    short min;
    int nr;
};
short v[1001][1001];
deque d[1001];
deque D[1001];
deque min, max;
short minval, maxval;

inline Ans Compute(short dx, short dy){
    Ans ans;
    ans.min = 10000;

    for(short i = 1; i <= m; ++i){
        d[i].clear();
        D[i].clear();
    }
    for(short j = 1; j <= n; ++j){
        min.clear();
        max.clear();
        for(short i = 1; i <= m; ++i){
            //minim
            while(!d[i].empty() && j - d[i].front() + 1 > dx)
                d[i].pop_front();
            while(!d[i].empty() && v[i][d[i].back()] > v[i][j])
                d[i].pop_back();
            d[i].push_back(j);
            //maxim
            while(!D[i].empty() && j - D[i].front() + 1 > dx)
                D[i].pop_front();
            while(!D[i].empty() && v[i][D[i].back()] < v[i][j])
                D[i].pop_back();
            D[i].push_back(j);

            //minim
            while(!min.empty() && i - min.front() + 1 > dy)
                min.pop_front();
            while(!min.empty() && v[min.back()][d[min.back()].front()] > v[i][d[i].front()])
                min.pop_back();
            min.push_back(i);
            //maxim
            while(!max.empty() && i - max.front() + 1 > dy)
                max.pop_front();
            while(!max.empty() && v[max.back()][D[max.back()].front()] < v[i][D[i].front()])
                max.pop_back();
            max.push_back(i);

            minval = v[min.front()][d[min.front()].front()];
            maxval = v[max.front()][D[max.front()].front()];
            if(i >= dy && j >= dx){
                if(maxval - minval < ans.min){
                    ans.min = maxval - minval;
                    ans.nr = 0;
                }
                if(maxval - minval == ans.min)
                    ans.nr++;
            }
        }
    }

    return ans;
}

int main(){
    fi=fopen("struti.in","r");
    fo=fopen("struti.out","w");

    short p, dx, dy;
    m = nextnum(), n = nextnum(), p = nextnum();
    for(short i = 1; i <= m; ++i)
        for(short j = 1; j <= n; ++j)
            v[i][j] = nextnum();
    for(short i = 1; i <= p; ++i){
        dx = nextnum();
        dy = nextnum();
        Ans a = Compute(dx, dy);
        Ans b = Compute(dy, dx);
        if(dx == dy)
            fprintf(fo,"%hd %d\n", a.min, a.nr);
        else{
            if(a.min < b.min)
                fprintf(fo,"%hd %d\n", a.min, a.nr);
            else if(a.min == b.min)
                fprintf(fo,"%hd %d\n", a.min, a.nr + b.nr);
            else
                fprintf(fo,"%hd %d\n", b.min, b.nr);
        }
    }

    fclose(fi);
    fclose(fo);
    return 0;
}