#include <bits/stdc++.h>
#define sz(x) ((int)(x).size())
#define all(x) begin(x), end(x)
#ifdef memset0
#define log(...) fprintf(stderr, __VA_ARGS__)
#else
#define endl '\n'
#define log(...) (void(0))
#endif
using namespace std;
using ll = long long;
using lf = long double;
using ull = unsigned long long;

const int N = 2e3 + 9;
int T, n, m, q;
bool a[N][N], b[N][N][4], inq[N][N];
queue<pair<int, int>> que;

void trans(int x, int y, int w) {
  if (x < 1 || y < 1 || x > n || y > m) {
    return;
  }
  if (!a[x][y] || inq[x][y]) {
    return;
  }
  // log("trans %d %d %d\n", x, y, w);
  b[x][y][w] = 0;
  if ((b[x][y][0] == false || b[x][y][1] == false) && (b[x][y][2] == false || b[x][y][3] == false)) {
    inq[x][y] = true;
    que.push(make_pair(x, y));
  }
}

void fall(int x, int y) {
  a[x][y] = 0;
  trans(x - 1, y, 0), trans(x + 1, y, 1);
  trans(x, y - 1, 2), trans(x, y + 1, 3);
}

int main() {
#ifdef memset0
  freopen("I.in", "r", stdin);
#endif
  cin.tie(0)->sync_with_stdio(0);
  cin >> T;
  while (T--) {
    cin >> n >> m >> q;
    for (int i = 1; i <= n; i++) {
      for (int j = 1; j <= m; j++) {
        a[i][j] = b[i][j][0] = b[i][j][1] = b[i][j][2] = b[i][j][3] = 1;
        inq[i][j] = 0;
      }
    }
    for (int x, y, i = 1; i <= q; i++) {
      int cnt = 0;
      cin >> x >> y;
      if (a[x][y]) {
        ++cnt;
        fall(x, y);
        while (que.size()) {
          ++cnt;
          auto [x, y] = que.front();
          que.pop();
          fall(x, y);
        }
      }
      cout << cnt << endl;
    }
  }
}