#include <bits/stdc++.h>
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-ftree-pre")
#pragma GCC optimize("-ftree-vrp")
#pragma GCC optimize("-fpeephole2")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-fsched-spec")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-falign-jumps")
#pragma GCC optimize("-falign-loops")
#pragma GCC optimize("-falign-labels")
#pragma GCC optimize("-fdevirtualize")
#pragma GCC optimize("-fcaller-saves")
#pragma GCC optimize("-fcrossjumping")
#pragma GCC optimize("-fthread-jumps")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-fwhole-program")
#pragma GCC optimize("-freorder-blocks")
#pragma GCC optimize("-fschedule-insns")
#pragma GCC optimize("inline-functions")
#pragma GCC optimize("-ftree-tail-merge")
#pragma GCC optimize("-fschedule-insns2")
#pragma GCC optimize("-fstrict-aliasing")
#pragma GCC optimize("-fstrict-overflow")
#pragma GCC optimize("-falign-functions")
#pragma GCC optimize("-fcse-skip-blocks")
#pragma GCC optimize("-fcse-follow-jumps")
#pragma GCC optimize("-fsched-interblock")
#pragma GCC optimize("-fpartial-inlining")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("-freorder-functions")
#pragma GCC optimize("-findirect-inlining")
#pragma GCC optimize("-fhoist-adjacent-loads")
#pragma GCC optimize("-frerun-cse-after-loop")
#pragma GCC optimize("inline-small-functions")
#pragma GCC optimize("-finline-small-functions")
#pragma GCC optimize("-ftree-switch-conversion")
#pragma GCC optimize("-foptimize-sibling-calls")
#pragma GCC optimize("-fexpensive-optimizations")
#pragma GCC optimize("-funsafe-loop-optimizations")
#pragma GCC optimize("inline-functions-called-once")
#pragma GCC optimize("-fdelete-null-pointer-checks")
using namespace std;
const int INF = 0x3f3f3f3f;
const long long llINF = 1e18;
const int MAXN = 2000 + 5;
int n, m, flag, Q, ansx, ansy, minDis;
struct UnionSet {
  int f[MAXN];
  void init() {
    for (int i = 0; i <= m + 1; i++) f[i] = i;
  }
  int find(int x) {
    if (x == f[x])
      return x;
    else
      return f[x] = find(f[x]);
  }
  void merge(int x, int y) { f[x] = y; }
} L[MAXN], R[MAXN];
bool Check(int d, int x0, int y0) {
  if (flag)
    return minDis > d ||
           (minDis == d && (y0 < ansy || (y0 == ansy && x0 < ansx)));
  else
    return minDis > d ||
           (minDis == d && (x0 < ansx || (x0 == ansx && y0 < ansy)));
}
int main() {
  scanf("%d%d%d", &n, &m, &Q);
  if (n > m) {
    swap(n, m);
    flag = 1;
  }
  for (int i = 1; i <= n; i++) L[i].init(), R[i].init();
  int sqrtk = sqrt(Q) + 10;
  while (Q--) {
    int x0, y0;
    scanf("%d%d", &x0, &y0);
    if (flag) swap(x0, y0);
    minDis = INF, ansx = INF, ansy = INF;
    for (int d = 0; d <= n && d <= minDis && d <= sqrtk; d++) {
      if (x0 - d >= 1) {
        int l = L[x0 - d].find(y0);
        int r = R[x0 - d].find(y0);
        if (l >= 1) {
          if (Check(y0 - l + d, x0 - d, l)) {
            minDis = y0 - l + d;
            ansx = x0 - d;
            ansy = l;
          }
        }
        if (r <= m) {
          if (Check(r - y0 + d, x0 - d, r)) {
            minDis = r - y0 + d;
            ansx = x0 - d;
            ansy = r;
          }
        }
      }
      if (x0 + d <= n) {
        int l = L[x0 + d].find(y0);
        int r = R[x0 + d].find(y0);
        if (l >= 1) {
          if (Check(y0 - l + d, x0 + d, l)) {
            minDis = y0 - l + d;
            ansx = x0 + d;
            ansy = l;
          }
        }
        if (r <= m) {
          if (Check(r - y0 + d, x0 + d, r)) {
            minDis = r - y0 + d;
            ansx = x0 + d;
            ansy = r;
          }
        }
      }
    }
    L[ansx].merge(ansy, ansy - 1);
    R[ansx].merge(ansy, ansy + 1);
    if (flag) swap(ansx, ansy);
    printf("%d %d\n", ansx, ansy);
  }
  return 0;
}
