#include <bits/stdc++.h>

using i64 = long long;

struct DSU {
    std::vector<int> fa, sz;
    DSU(int n = 0) { init(n); }
    void init(int n) {
        fa.resize(n), std::iota(fa.begin(), fa.end(), 0);
        sz.assign(n, 1);
    }
    int find(int x) {
        while (x != fa[x]) x = fa[x] = fa[fa[x]];
        return x;
    }
    bool same(int x, int y) { return find(x) == find(y); }
    bool merge(int x, int y) {
        if ((x = find(x)) == (y = find(y))) return false;
        return sz[x] += sz[y], fa[y] = x, true;
    }
    int size(int x) { return sz[find(x)]; }
};

void solve() {
    int n, m, k;
    std::cin >> n >> m >> k;

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

    i64 ans = 0;
    int width = 0, comp = 0;
    DSU dsu(k);
    auto merge = [&](int x, int y) {
        if (dsu.merge(x, y)) {
            comp -= 1;
        }
    };

    std::map<int, std::pair<int, int>> mp;
    for (int i = 0; i < n; ++i) {
        for (auto [l, r, id] : add[i]) {
            auto it = mp.lower_bound(l);
            if (it != mp.begin()) {
                --it;
            }
            while (it != mp.end() && it->first < r) {
                if (l < it->second.first) {
                    merge(id, it->second.second);
                }
                ++it;
            }
            mp[l] = {r, id};
            width += r - l;
            comp += 1;
        }
        for (auto [l, r, id] : del[i]) {
            mp.erase(l);
            width -= r - l;
        }
        for (auto [l, r, id] : add[i]) {
            auto it = mp.lower_bound(l);
            if (it != mp.begin() && std::prev(it)->second.first == l) {
                merge(id, std::prev(it)->second.second);
            }
            if (it != mp.end() && std::next(it)->first == r) {
                merge(id, std::next(it)->second.second);
            }
        }
        ans += width;

        std::cout << ans << ' ' << comp << '\n';
    }
}

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

    int t;
    std::cin >> t;

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

    return 0;
}