#include <cstdio>

const int N = 1005, INF = 2000000000;

int q, L, C, rez, nrs, dqm[N], dqM[N], a[N][N], m[N][N], M[N][N], dm[N][N], dM[N][N];

void read() {
  scanf("%d%d%d", &L, &C, &q);
  
  for (int i = 1; i <= L; ++i) 
    for (int j = 1; j <= C; ++j) 
      scanf("%d", &a[i][j]);
}

void solve(int lin, int col) {
  int stm, drm, stM, drM;

  for (int i = 1; i <= L; ++i) {
    stm = drm = 1, dqm[1] = 1, m[i][1] = a[i][1];
    stM = drM = 1, dqM[1] = 1, M[i][1] = a[i][1];

    for (int j = 2; j <= C; ++j)  {
      if (j - dqm[stm] + 1 > col)
        ++stm;
      while (a[i][dqm[drm]] > a[i][j] && drm >= stm)
        --drm;
      dqm[++drm] = j;
      m[i][j] = a[i][dqm[stm]];

      if (j - dqM[stM] + 1 > col)
        ++stM;
      while (a[i][dqM[drM]] < a[i][j] && drM >= stM)
        --drM;
      dqM[++drM] = j;
      M[i][j] = a[i][dqM[stM]];
    }
  }

  for (int j = 1; j <= C; ++j) {
    stm = drm = 1, dqm[1] = 1, dm[1][j] = m[1][j];
    stM = drM = 1, dqM[1] = 1, dM[1][j] = M[1][j];
    
    for (int i = 2; i <= L; ++i) {
      if (i - dqm[stm] + 1 > lin)
        ++stm;
      while (m[dqm[drm]][j] > m[i][j] && drm >= stm)
        --drm;
      dqm[++drm] = i;
      dm[i][j] = m[dqm[stm]][j];

      if (i - dqM[stM] + 1 > lin)
        ++stM;
      while (M[dqM[drM]][j] < M[i][j] && drM >= stM)
        --drM;
      dqM[++drM] = i;
      dM[i][j] = M[dqM[stM]][j];
    }
  }

  for (int i = lin; i <= L; ++i)
    for (int j = col; j <= C; ++j) 
      if (dM[i][j] - dm[i][j] < rez)
        rez = dM[i][j] - dm[i][j], nrs = 1;
      else if (dM[i][j] - dm[i][j] == rez)
        ++nrs;
}

void solve() {
  int x, y;

  for (int i = 1; i <= q; ++i) {
    scanf("%d%d", &x, &y);

    rez = INF, nrs = 0;

    solve(x, y);
    
    if (x != y)
      solve(y, x);
  
    printf("%d %d\n", rez, nrs);
  }
}

int main() {
  freopen("struti.in", "r", stdin);
  freopen("struti.out", "w", stdout);

  read();

  solve();

  return 0;
}