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

const int mod = 998244353;
const int N = 1e5 + 5;

int n, m, k, fa[N], C1[N], C2[N];
ll ans1, ans2, cnt;
vector<int> add[N], del[N];
int find(int x) {
    return x == fa[x] ? x : fa[x] = find(fa[x]);
}
void merge(int u, int v) {
    u = find(u), v = find(v);
    if (u == v) return;
    fa[u] = v;
    ans2--;
}

void solve() {
    cin >> n >> m >> k;
    map<pair<int, int>, int> mp;
    ans1 = ans2 = cnt = 0;
    for (int i = 1; i <= n + 1; i++) add[i].clear(), del[i].clear();
    iota(fa + 1, fa + k + 1, 1);
    for (int i = 1; i <= k; i++) {
        int r1, c1, r2, c2;
        cin >> r1 >> c1 >> r2 >> c2;
        C1[i] = c1, C2[i] = c2;
        add[r1].push_back(i);
        del[r2 + 1].push_back(i);
    }
    for (int i = 1; i <= n; i++) {
        for (int idx : add[i]) {
            int l = C1[idx], r = C2[idx];
            auto it = mp.lower_bound({l, 0});
            if (it != mp.begin()) it = prev(it);
            while (it != mp.end() && it->first.first <= r) {
                if (it->first.second >= l) merge(it->second, idx);
                ++it;
            }
        }
        for (int idx : del[i]) {
            int l = C1[idx], r = C2[idx];
            cnt -= r - l + 1;
            mp.erase({l, r});
        }
        for (int idx : add[i]) {
            int l = C1[idx], r = C2[idx];
            mp[{l, r}] = idx;
            auto it = mp.find({l, r});
            if (it != mp.begin() && prev(it)->first.second == l - 1) merge(prev(it)->second, idx);
            if (next(it) != mp.end() && next(it)->first.first == r + 1) merge(next(it)->second, idx);
            cnt += r - l + 1;
        }
        ans1 += cnt, ans2 += add[i].size();
        cout << ans1 << ' ' << ans2 << '\n';    
    }
}

int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    int T = 1;
    cin >> T;
    while (T--) solve();
    return 0;
}