#include <bits/stdc++.h>
#define N 1008

using namespace std;

//ifstream fin("struti.in");
ofstream fout("struti.out");

class InParser {
private:
	FILE *fin;
	char *buff;
	int sp;

	char read_ch() {
		++sp;
		if (sp == 4096) {
			sp = 0;
			fread(buff, 1, 4096, fin);
		}
		return buff[sp];
	}

public:
	InParser(const char* nume) {
		fin = fopen(nume, "r");
		buff = new char[4096]();
		sp = 4095;
	}

	InParser& operator >> (int &n) {
		char c;
		while (!isdigit(c = read_ch()) && c != '-');
		int sgn = 1;
		if (c == '-') {
			n = 0;
			sgn = -1;
		} else {
			n = c - '0';
		}
		while (isdigit(c = read_ch())) {
			n = 10 * n + c - '0';
		}
		n *= sgn;
		return *this;
	}

	InParser& operator >> (long long &n) {
		char c;
		n = 0;
		while (!isdigit(c = read_ch()) && c != '-');
		long long sgn = 1;
		if (c == '-') {
			n = 0;
			sgn = -1;
		} else {
			n = c - '0';
		}
		while (isdigit(c = read_ch())) {
			n = 10 * n + c - '0';
		}
		n *= sgn;
		return *this;
	}
};

InParser fin("struti.in");

const int INF = 1e4;

int p;
int n, m;
int A[N][N];
int mini[N][N], maxi[N][N];



void coloana_mini(int c, int dy)
{
    int i;
    deque<int> d;
    for( i = 0; i < n; i++)
    {
        if(!d.empty() && d.front() == i - dy)
            d.pop_front();

        while(!d.empty() && A[d.back()][c] >= A[i][c])
            d.pop_back();

        d.push_back(i);
        mini[i][c] = A[d.front()][c];
    }
}

void calcul_mini(int dy)
{
    int j;
    for( j = 0; j < m; j++)
        coloana_mini(j, dy);

}

void coloana_maxi(int c, int dy)
{
    int i;
    deque<int> d;
    for( i = 0; i < n; i++)
    {
        if(!d.empty() && d.front() == i - dy)
            d.pop_front();

        while(!d.empty() && A[d.back()][c] <= A[i][c])
            d.pop_back();

        d.push_back(i);
        maxi[i][c] = A[d.front()][c];
    }
}

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

void diferenta_min(int dx, int dy, int &dif_min, int &nr)
{
    int i, j;
    calcul_mini(dy);
    calcul_maxi(dy);
    for( i = dy - 1; i < n; i++)
    {
        deque<int> dmin, dmax;
        for( j = 0; j < m; j++)
        {
            ///dmin
            if(!dmin.empty() && dmin.front() == j - dx)
                dmin.pop_front();

            while(!dmin.empty() && mini[i][dmin.back()] >= mini[i][j])
                dmin.pop_back();

            dmin.push_back(j);

            ///dmax
            if(!dmax.empty() && dmax.front() == j - dx)
                dmax.pop_front();

            while(!dmax.empty() && maxi[i][dmax.back()] <= maxi[i][j])
                dmax.pop_back();

            dmax.push_back(j);

            ///answer
            if(j < dx - 1) continue;

            int rez_actual = maxi[i][dmax.front()] - mini[i][dmin.front()];
            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);
    if (dx != dy)
        diferenta_min(dy, dx, difmin, nr);

    fout << difmin << " " << nr << "\n";
}

void Citire()
{
    int i, j;
    fin >> n >> m >> p;
    for( i = 0; i < n; i++)
        for( j = 0; j < m; j++)
            fin >> A[i][j];
}

void Rezolvare()
{
    int i;
    for ( i = 0; i < p; i++)
    {
        int dx, dy;
        fin >> dx >> dy;
        calcul(dx, dy);
    }
}

int main()
{
    Citire();
    Rezolvare();
    fout.close();
    return 0;
}