#include <bits/stdc++.h>
using namespace std;

#define all(x) begin(x), end(x)
#ifdef CKISEKI
#define safe cerr << __PRETTY_FUNCTION__ << " line " << __LINE__ << " safe\n"
#define debug(a...) debug_(#a, a)
#define orange(a...) orange_(#a, a)
template <typename ...T>
void debug_(const char *s, T ...a) {
    cerr << "\e[1;32m(" << s << ") = (";
    int cnt = sizeof...(T);
    (..., (cerr << a << (--cnt ? ", " : ")\e[0m\n")));
}
template <typename I>
void orange_(const char *s, I L, I R) {
    cerr << "\e[1;32m[ " << s << " ] = [ ";
    for (int f = 0; L != R; L++)
        cerr << (f++ ? ", " : "") << *L;
    cerr << " ]\e[0m\n";
}
#else 
#define safe ((void)0)
#define debug(...) safe
#define orange(...) safe
#endif

const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    int T;
    cin >> T;
    while (T--) {
        int n, m;
        int q;
        cin >> n >> m >> q;
        vector<vector<int>> g(n + 2, vector<int>(m + 2));
        vector<vector<int>> dead(n + 2, vector<int>(m + 2));

        const auto check = [&](int x, int y) {
            return (dead[x + 1][y] || dead[x - 1][y]) && (dead[x][y + 1] || dead[x][y - 1]);
        };

        queue<pair<int,int>> que;
        while (q--) {
            int xx, yy;
            cin >> xx >> yy;
            if (!dead[xx][yy]) {
                dead[xx][yy] = true;
                que.emplace(xx, yy);
            }
            int cnt = 0;

            while (!que.empty()) {
                auto [x, y] = que.front(); que.pop();
                ++cnt;
                for (int k = 0; k < 4; k++) {
                    int nx = x + dx[k];
                    int ny = y + dy[k];
                    if (!dead[nx][ny] && 1 <= nx && nx <= n && 1 <= ny && ny <= m && check(nx, ny)) {
                        dead[nx][ny] = true;
                        que.emplace(nx, ny);
                    }
                }
            }

            cout << cnt << '\n';
        }
    }
    return 0;
}