#include <iostream>
#include <fstream>
#include <stack>
#include <vector>
#include <deque>

using namespace std;
const int inf = 3e4 + 5;
const int NMax = 1e3 + 5;

class parser {
    using integer = short;
    static const int strMax = 6*NMax*NMax + 50;

    ifstream in;
    char str[strMax],*p;

    public:
    parser(const string& s) {
        in.open(s);
        in.get(str,strMax,1);
        p = str;
    }

    parser& operator>> (integer& nr) {
        while ( !( ('0' <= *p && *p <= '9') || *p == '\0') ) {
            ++p;
        }

        int temp = 0;
        while ('0' <= *p && *p <= '9') {
            temp = temp * 10 + *p++ - '0';
        }
        nr = temp;

        return *this;
    }
    void close() {
        in.close();
    }
};
parser pin("struti.in");
ofstream out("struti.out");

#define ll long long
#define ull unsigned long long
#define pb push_back
using zint = short;

zint N,M,P;
zint a[NMax][NMax],rmn[NMax][NMax],rmx[NMax][NMax];
//deque< pair<zint,zint> > dmn,dmx;

void solve(zint,zint,zint&,int&);
void insertMax(deque< pair<zint,zint> >&,zint,zint,zint);
void insertMin(deque< pair<zint,zint> >&,zint,zint,zint);

int main() {
    pin>>N>>M>>P;
    for (zint i=1;i <= N;++i) {
        for (zint j=1;j <= M;++j) {
            pin>>a[i][j];
        }
    }

    while (P--) {
        zint dx,dy,min1,min2;
        int nrMin1,nrMin2;
        pin>>dx>>dy;

        solve(dx,dy,min1,nrMin1);
        //cout<<min1<<' '<<nrMin1<<'\n';
        if (dx != dy) {
            solve(dy,dx,min2,nrMin2);
            //cout<<min2<<' '<<nrMin2<<'\n';

            if (min1 == min2) {
                nrMin1 += nrMin2;
            }
            else if (min1 > min2) {
                min1 = min2;
                nrMin1 = nrMin2;
            }
        }
        //cout<<'\n';

        out<<min1<<' '<<nrMin1<<'\n';
    }

    pin.close();out.close();
    return 0;
}

void solve(zint dx,zint dy,zint& mn,int& nrMin) {
    for (zint i=1;i <= N;++i) {
        deque< pair<zint,zint> > dmn,dmx;

        for (zint j=1;j <= M;++j) {
            insertMin(dmn,j,a[i][j],dy);
            insertMax(dmx,j,a[i][j],dy);

            //cout<<dmn.front().second<<' ';
            rmn[i][j] = dmn.front().second;
            rmx[i][j] = dmx.front().second;
        }
        //cout<<'\n';
    }
    //cout<<'\n';

    /*
    out<<dx<<' '<<dy<<'\n';
    for (int i=1;i <= N;++i) {
        for (int j=1;j <= M;++j) {
            out<<rmn[i][j]<<' ';
        }
        out<<'\n';
    }
    out<<'\n';
    for (int i=1;i <= N;++i) {
        for (int j=1;j <= M;++j) {
            out<<rmx[i][j]<<' ';
        }
        out<<'\n';
    }
    out<<"\n\n";
    //*/

    mn = inf, nrMin = 0;
    for (zint j=dy;j <= M;++j) {
        deque< pair<zint,zint> > dmn,dmx;

        for (zint i=1;i <= N;++i) {
            insertMin(dmn,i,rmn[i][j],dx);
            insertMax(dmx,i,rmx[i][j],dx);

            if (i >= dx) {
                zint val = dmx.front().second - dmn.front().second;

                if (mn > val) {
                    mn = val;
                    nrMin = 1;
                }
                else if (mn == val) {
                    ++nrMin;
                }
            }
        }
    }
}

void insertMax(deque< pair<zint,zint> > &d,zint idx,zint val,zint len) {
    while (d.size() && d.back().second <= val) {
        d.pop_back();
    }
    d.push_back( pair<zint,zint>(idx,val) );

    if (d.front().first == idx - len) {
        d.pop_front();
    }
}

void insertMin(deque< pair<zint,zint> > &d,zint idx,zint val,zint len) {
    while (d.size() && d.back().second >= val) {
        d.pop_back();
    }
    d.push_back( pair<zint,zint>(idx,val) );

    if (d.front().first == idx - len) {
        d.pop_front();
    }
}