#include <bits/stdc++.h>

using i64 = long long;

void solve() {
    int n, m, k;
    std::cin >> n >> m >> k;
    
    std::vector<int> r1(k), r2(k), c1(k), c2(k);
    std::vector<std::vector<int>> add(n);
    std::vector<std::vector<int>> del(n);
    
    for (int i = 0; i < k; i++) {
        std::cin >> r1[i] >> c1[i] >> r2[i] >> c2[i];
        r1[i]--, c1[i]--;
        add[r1[i]].push_back(i);
        if (r2[i] < n) {
            del[r2[i]].push_back(i);
        }
    }
    
    std::vector<int> f(k);
    std::iota(f.begin(), f.end(), 0);
    auto find = [&](int x) {
        while (f[x] != x) {
            x = f[x] = f[f[x]];
        }
        return x;
    };
    
    i64 ans = 0;
    int comp = 0;
    int width = 0;
    auto merge = [&](int x, int y) {
        x = find(x);
        y = find(y);
        if (x != y) {
            f[y] = x;
            comp--;
        }
    };
    
    std::set<std::array<int, 3>> s;
    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)[0] < c2[i]) {
                if ((*it)[1] > c1[i]) {
                    merge((*it)[2], i);
                }
                it++;
            }
        }
        for (auto i : del[x]) {
            width -= 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()) {
                auto prv = std::prev(it);
                if ((*prv)[1] == c1[i]) {
                    merge((*prv)[2], i);
                }
            }
            auto nxt = std::next(it);
            if (nxt != s.end()) {
                if ((*nxt)[0] == c2[i]) {
                    merge((*nxt)[2], i);
                }
            }
            width += c2[i] - c1[i];
            comp++;
        }
        ans += width;
        std::cout << ans << " " << comp << "\n";
    }
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    
    int t;
    std::cin >> t;
    
    while (t--) {
        solve();
    }
    
    return 0;
}