#include <fstream>
#include <deque>

const int MAX_N = 1e3;
int a[1 + MAX_N][1 + MAX_N], Max[1 + MAX_N], Min[1 + MAX_N];
std::deque<int> dqMax[1 + MAX_N];
std::deque<int> dqMin[1 + MAX_N];
std::deque<int> dq1; // de min
std::deque<int> dq2; // 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);
      Min[i] = a[dqMin[i].front()][i];
      Max[i] = a[dqMax[i].front()][i];
    }
    while (!dq1.empty()) {
      dq1.pop_back();
    }
    while (!dq2.empty()) {
      dq2.pop_back();
    }
    for (int i = 1; i <= y - 1; i++) {
      while (!dq1.empty() && Min[i] <= Min[dq1.back()]) {
        dq1.pop_back();
      }
      dq1.push_back(i);
      while (!dq2.empty() && Max[i] >= Max[dq2.back()]) {
        dq2.pop_back();
      }
      dq2.push_back(i);
    }
    for (int i = y; i <= m; i++) {
      if (!dq1.empty() && dq1.front() == i - y) {
        dq1.pop_front();
      }
      while (!dq1.empty() && Min[i] <= Min[dq1.back()]) {
        dq1.pop_back();
      }
      dq1.push_back(i);
      if (!dq2.empty() && dq2.front() == i - y) {
        dq2.pop_front();
      }
      while (!dq2.empty() && Max[i] >= Max[dq2.back()]) {
        dq2.pop_back();
      }
      dq2.push_back(i);
      int dif = Max[dq2.front()] - Min[dq1.front()];
      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;
	}
};

class OutParser {
private:
    FILE *fout;
    char *buff;
    int sp;

    void write_ch(char ch) {
        if (sp == 50000) {
            fwrite(buff, 1, 50000, fout);
            sp = 0;
            buff[sp++] = ch;
        } else {
            buff[sp++] = ch;
        }
    }


public:
    OutParser(const char* name) {
        fout = fopen(name, "w");
        buff = new char[50000]();
        sp = 0;
    }
    ~OutParser() {
        fwrite(buff, 1, sp, fout);
        fclose(fout);
    }

    OutParser& operator << (int vu32) {
        if (vu32 <= 9) {
            write_ch(vu32 + '0');
        } else {
            (*this) << (vu32 / 10);
            write_ch(vu32 % 10 + '0');
        }
        return *this;
    }

    OutParser& operator << (long long vu64) {
        if (vu64 <= 9) {
            write_ch(vu64 + '0');
        } else {
            (*this) << (vu64 / 10);
            write_ch(vu64 % 10 + '0');
        }
        return *this;
    }

    OutParser& operator << (char ch) {
        write_ch(ch);
        return *this;
    }
    OutParser& operator << (const char *ch) {
        while (*ch) {
            write_ch(*ch);
            ++ch;
        }
        return *this;
    }
};

int main() {
  InParser fin("struti.in");
  OutParser 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;
}