#include<iostream>
#include<cstring>
#include<vector>
#include<array>
using namespace std;
using LL = long long;
int p[1000005];

int find(int x){
    return p[x] == x ? x : p[x] = find(p[x]);
}

bool merge(int x, int y){
    x = find(x), y = find(y);
    if (x == y) return false;
    p[x] = y;
    return true;
}

int main(){

#ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("data.out", "w", stdout);
#endif

    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);

    vector<int> id(1000005), c(1000005);
    int T;
    cin >> T;
    while(T--){
        int n, m, k;
        cin >> n >> m >> k;
        vector<vector<pair<int, int> > > pos(n + 2);
        vector<vector<int> > add(n + 2), del(n + 2);
        vector<LL> s(n + 2);
        for(int i = 0; i < k; i++){
            int x1, y1, x2, y2;
            cin >> x1 >> y1 >> x2 >> y2;
            if (x1 == x2){
                pos[x1].push_back({y1, y2});
                s[x1] += y2 - y1 + 1;
                s[x1 + 1] -= y2 - y1 + 1;
            }
            else{
                add[x1].push_back(y1);
                del[x2 + 1].push_back(y1);
                s[x1] += 1;
                s[x2 + 1] -= 1;
            }
        }
        for(int i = 1; i <= n; i++) s[i] += s[i - 1];
        for(int i = 1; i <= n; i++) s[i] += s[i - 1];
        int conn = 0, idx = 0;
        vector<array<int, 3> > last;
        
        for(int i = 1; i <= n; i++){
            for(auto x : add[i]){
                ++c[x];
                if (!id[x]){
                    id[x] = ++idx;
                    conn += 1;
                    p[idx] = idx;
                }
            }
            vector<pair<int, int> > last2;
            for(auto x : del[i]){
                last2.push_back({x, id[x]});
                if (--c[x] == 0){
                    id[x] = 0;
                }
            }
            for(auto x : add[i]){
                if (id[x - 1]) conn -= merge(id[x], id[x - 1]);
                if (id[x + 1]) conn -= merge(id[x], id[x + 1]);
            }
            sort(last2.begin(), last2.end());
            sort(pos[i].begin(), pos[i].end());
            int j = -1, k = -1;
            vector<array<int, 3> > cur;
            for(auto [l, r] : pos[i]){
                ++idx;
                p[idx] = idx;
                conn += 1;
                if (j >= 0 && j < last.size()){
                    auto [L, R, id] = last[j];
                    if (max(L, l) <= min(R, r)){
                        conn -= merge(idx, id);
                    }
                }
                while(j + 1 < last.size() && last[j + 1][0] <= r){
                    auto [L, R, id] = last[++j];
                    if (max(L, l) <= min(R, r)){
                        conn -= merge(idx, id);
                    }
                }
                while(k + 1 < last2.size() && last2[k + 1].first <= r){
                    auto [x, id] = last2[++k];
                    if (x >= l && x <= r){
                        conn -= merge(idx, id);
                    }
                }
                if (id[l - 1]) conn -= merge(idx, id[l - 1]);
                if (id[r + 1]) conn -= merge(idx, id[r + 1]);
                cur.push_back({l, r, idx});
            }
            last.swap(cur);
            cout << s[i] << ' ' << conn << '\n';
        }
    }

}