#include <fstream>
#include <deque>
#include <iomanip>

using namespace std;

const int N = 1000;
const int INF = 1e4;

int nl, nc, a[N][N], mini[N][N], maxi[N][N];
int d[N], dmax[N], dmin[N];

ifstream in("struti.in");
ofstream out("struti.out");

void coloana_mini(int c, int dy)
{
    int st = 0, dr = -1;
    for (int i = 0; i < nl; i++)
    {
        if (st <= dr && d[st] == i - dy)
        {
            st++;
        }
        while (st <= dr && a[d[dr]][c] >= a[i][c])
        {
            dr--;
        }
        d[++dr] = i;
        mini[i][c] = a[d[st]][c];
    }
}

void calcul_mini(int dy)
{
    for (int j = 0; j < nc; j++)
    {
        coloana_mini(j, dy);///calculeaza elem. lui mini de pe coloana j
    }
}

void coloana_maxi(int c, int dy)
{
    int st = 0, dr = -1;
    for (int i = 0; i < nl; i++)
    {
        if (st <= dr && d[st] == i - dy)
        {
            st++;
        }
        while (st <= dr && a[d[dr]][c] <= a[i][c])
        {
            dr--;
        }
        d[++dr] = i;
        maxi[i][c] = a[d[st]][c];
    }
}

void calcul_maxi(int dy)
{
    for (int j = 0; j < nc; j++)
    {
        coloana_maxi(j, dy);
    }
}

void diferenta_min(int dx, int dy, int &dif_min, int &nr)
{
    calcul_mini(dy);
    calcul_maxi(dy);
    int stmax = 0, drmax = -1, stmin = 0, drmin = -1;
    for (int i = dy - 1; i < nl; i++)
    {
        stmax = stmin = 0;
        drmax = drmin = -1;
        for (int j = 0; j < nc; j++)
        {
            ///actualizez in deque-ul de minime
            if (stmin <= drmin && dmin[stmin] == j - dx)
            {
                stmin++;
            }
            while (stmin <= drmin && mini[i][dmin[drmin]] >= mini[i][j])
            {
                drmin--;
            }
            dmin[++drmin] = j;
            ///actualizez in deque-ul de maxime
            if (stmax <= drmax && dmax[stmax] == j - dx)
            {
                stmax++;
            }
            while (stmax <= drmax && maxi[i][dmax[drmax]] <= maxi[i][j])
            {
                drmax--;
            }
            dmax[++drmax] = j;
            if (j < dx - 1) continue;///am mai putin de dx coloane in submatricea curenta
            int rez_actual = maxi[i][dmax[stmax]] - mini[i][dmin[stmin]];
            if (rez_actual < dif_min)
            {
                dif_min = rez_actual;
                nr = 1;
            }
            else if (rez_actual == dif_min)
            {
                nr++;
            }
        }
    }
}

void calcul(int dx, int dy)
{
    int difmin = INF;
    int nr;
    diferenta_min(dx, dy, difmin, nr);///calculez difmin si nr pentru dx pe oriz si dy pe verticala
    if (dx != dy)///daca submatricea nu e patrata
    {
        diferenta_min(dy, dx, difmin, nr);///actualizez rezultatele pentru submatricea rotita
    }
    out << difmin << " " << nr << "\n";
}

int main()
{
    int p;
    in >> nl >> nc >> p;
    for (int i = 0; i < nl; i++)
    {
        for (int j = 0; j < nc; j++)
        {
            in >> a[i][j];
        }
    }
    for (int i = 0; i < p; i++)
    {
        int dx, dy;
        in >> dx >> dy;
        calcul(dx, dy);
    }
    in.close();
    out.close();
    return 0;
}