#include <bits/stdc++.h>
#define MAXN ((int) 1e5)
#define MAXK ((int) 1e5)
using namespace std;
typedef pair<int, int> pii;

int n, K, ans1, ans2;
int R1[MAXK + 10], C1[MAXK + 10], R2[MAXK + 10], C2[MAXK + 10];

vector<int> add[MAXK + 10], del[MAXK + 10];
int root[MAXK + 10];

int findroot(int x) {
    if (root[x] != x) root[x] = findroot(root[x]);
    return root[x];
}

void merge(int x, int y) {
    x = findroot(x); y = findroot(y);
    if (x == y) return;
    root[x] = y;
    ans2--;
}

void solve() {
    scanf("%d%*d%d", &n, &K);
    for (int i = 1; i <= n + 1; i++) add[i].clear(), del[i].clear();
    for (int i = 1; i <= K; i++) {
        scanf("%d%d%d%d", &R1[i], &C1[i], &R2[i], &C2[i]);
        add[R1[i]].push_back(i);
        del[R2[i] + 1].push_back(i);
    }
    for (int i = 1; i <= K; i++) root[i] = i;

    ans1 = ans2 = 0;
    int cnt = 0;
    map<pii, int> mp;
    for (int i = 1; i <= n; i++) {
        for (int idx : add[i]) {
            cnt += C2[idx] - C1[idx] + 1;
            auto it = mp.lower_bound(pii(C1[idx], 0));
            if (it != mp.begin()) it = prev(it);
            while (it != mp.end() && it->first.first <= C2[idx]) {
                if (it->first.second >= C1[idx]) merge(it->second, idx);
                it++;
            }
        }

        for (int idx : del[i]) {
            cnt -= C2[idx] - C1[idx] + 1;
            mp.erase(pii(C1[idx], C2[idx]));
        }

        ans1 += cnt; ans2 += add[i].size();
        for (int idx : add[i]) {
            mp[pii(C1[idx], C2[idx])] = idx;
            auto it = mp.find(pii(C1[idx], C2[idx]));
            if (it != mp.begin() && prev(it)->first.second == C1[idx] - 1) merge(prev(it)->second, idx);
            if (next(it) != mp.end() && next(it)->first.first == C2[idx] + 1) merge(next(it)->second, idx);
        }
        printf("%d %d\n", ans1, ans2);
    }
}

int main() {
    int tcase; scanf("%d", &tcase);
    while (tcase--) solve();
    return 0;
}