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

using i64 = long long;

struct DSU {
    int n, cnt;
    vector<int> fa, sz;
    DSU(int n = 0) : n(n), cnt(n), fa(n), sz(n, 1) { iota(fa.begin(), fa.end(), 0); }
    int find(int u) { return u == fa[u] ? u : fa[u] = find(fa[u]); }
    bool join(int u, int v) {
        u = find(u), v = find(v);
        if (u != v) {
            // if (sz[u] < sz[v]) { swap(u, v); }
            sz[u] += sz[v];
            fa[v] = u;
            cnt--;
            return true;
        }
        return false;
    }
    bool same(int u, int v) { return find(u) == find(v); }
    int size(int u) { return sz[find(u)]; }
};

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);

    int t;
    cin >> t;

    auto solve = [&]() {
        int n, m, k;
        cin >> n >> m >> k;

        vector<int> r1(k), c1(k), r2(k), c2(k);
        vector<vector<int>> add(n), del(n + 1);
        for (int i = 0; i < k; i++) {
            cin >> r1[i] >> c1[i] >> r2[i] >> c2[i];
            r1[i]--, c1[i]--;
            add[r1[i]].push_back(i);
            del[r2[i]].push_back(i);
        }

        DSU dsu(k);

        i64 black = 0;
        int in = 0;
        set<array<int, 3>> s;
        int cnt = 0;

        for (int x = 0; x < n; x++) {
            for (auto i : add[x]) {
                auto it = s.lower_bound({c1[i], 0, 0});
                if (it != s.begin()) {
                    it--;
                }
                while (it != s.end() && it->at(0) < c2[i]) {
                    if (it->at(1) > c1[i]) {
                        dsu.join(i, it->at(2));
                    }
                    it++;
                }
            }
            for (auto i : del[x]) {
                cnt -= c2[i] - c1[i];
                s.erase({c1[i], c2[i], i});
            }
            for (auto i : add[x]) {
                auto it = s.insert({c1[i], c2[i], i}).first;
                if (it != s.begin() && prev(it)->at(1) == c1[i]) {
                    dsu.join(i, prev(it)->at(2));
                }
                if (next(it) != s.end() && next(it)->at(0) == c2[i]) {
                    dsu.join(i, next(it)->at(2));
                }
                cnt += c2[i] - c1[i];
                in++;
            }
            black += cnt;
            int comps = in - k + dsu.cnt;
            cout << black << ' ' << comps << '\n';
        }
    };

    while (t--) {
        solve();
    }
    
    return 0;
}