#include <fstream>
#include <deque>

const int MAX_N = 1e3;
int a[1 + MAX_N][1 + MAX_N];
short int Max[1 + MAX_N], Min[1 + MAX_N];
std::deque<short int> dqMax[1 + MAX_N];
std::deque<short int> dqMin[1 + MAX_N];
short int dq1[1 + MAX_N]; // de min
short int dq2[1 + MAX_N]; // de max
int n, m;

void solve(int &mn, int &cnt, int x, int y) {
  for (int i = 1; i <= m; i++) {
    while (!dqMin[i].empty()) {
      dqMin[i].pop_back();
    }
    while (!dqMax[i].empty()) {
      dqMax[i].pop_back();
    }
  }
  for (int lin = 1; lin <= x - 1; lin++) {
    for (int i = 1; i <= m; i++) {
      while (!dqMin[i].empty() && a[lin][i] <= a[dqMin[i].back()][i]) {
        dqMin[i].pop_back();
      }
      dqMin[i].push_back(lin);
      while (!dqMax[i].empty() && a[lin][i] >= a[dqMax[i].back()][i]) {
        dqMax[i].pop_back();
      }
      dqMax[i].push_back(lin);
    }
  }
  for (int lin = x; lin <= n; lin++) {
    for (int i = 1; i <= m; i++) {
      if (!dqMin[i].empty() && dqMin[i].front() == lin - x) {
        dqMin[i].pop_front();
      }
      while (!dqMin[i].empty() && a[lin][i] <= a[dqMin[i].back()][i]) {
        dqMin[i].pop_back();
      }
      dqMin[i].push_back(lin);
      if (!dqMax[i].empty() && dqMax[i].front() == lin - x) {
        dqMax[i].pop_front();
      }
      while (!dqMax[i].empty() && a[lin][i] >= a[dqMax[i].back()][i]) {
        dqMax[i].pop_back();
      }
      dqMax[i].push_back(lin);
    }
    for (int i = 1; i <= m; i++) {
      Min[i] = a[dqMin[i].front()][i];
      Max[i] = a[dqMax[i].front()][i];
    }
    int l1 = 1, r1 = 0, l2 = 1, r2 = 0;
    for (int i = 1; i <= y - 1; i++) {
      while (l1 <= r1 && Min[i] <= Min[dq1[r1]]) {
        r1--;
      }
      dq1[++r1] = i;
      while (l2 <= r2 && Max[i] >= Max[dq2[r2]]) {
        r2--;
      }
      dq2[++r2] = i;
    }
    for (int i = y; i <= m; i++) {
      if (l1 <= r1 && dq1[l1] == i - y) {
        l1++;
      }
      while (l1 <= r1 && Min[i] <= Min[dq1[r1]]) {
        r1--;
      }
      dq1[++r1] = i;
      if (l2 <= r2 && dq2[l2] == i - y) {
        l2++;
      }
      while (l2 <= r2 && Max[i] >= Max[dq2[r2]]) {
        r2--;
      }
      dq2[++r2] = i;
      int dif = Max[dq2[l2]] - Min[dq1[l1]];
      if (dif < mn) {
        mn = dif;
        cnt = 1;
      } else if (dif == mn) {
        cnt++;
      }
    }
  }
}

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;
	}
};

int main() {
  InParser fin("struti.in");
  std::ofstream fout("struti.out");
  int q;
  fin >> n >> m >> q;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++) {
      fin >> a[i][j];
    }
  }
  while (q--) {
    int x, y;
    fin >> x >> y;
    int mn = (1 << 30), cnt = 0;
    solve(mn, cnt, x, y);
    if (x != y) {
      solve(mn, cnt, y, x);
    }
    fout << mn << " " << cnt << "\n";
  }
  return 0;
}