#pragma GCC optimize("Ofast")
#pragma GCC target("avx2")
#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define flt double
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()

vector<int> dsu;

int get(int v) {
    return dsu[v] < 0 ? v : dsu[v] = get(dsu[v]);
}

bool unite(int a, int b) {
    a = get(a), b = get(b);
    if (a == b) return false;
    if (dsu[a] > dsu[b]) swap(a, b);
    dsu[a] += dsu[b];
    return dsu[b] = a, true;
}

struct seg {
    int l, r, idx;
    bool operator<(const seg& o) const {
        return r < o.r;
    }
    seg(int l, int r, int id) : l(l), r(r), idx(id) {}
};

struct rct {
    int r1, c1, r2, c2;
    rct(int r1 = 0, int c1 = 0, int r2 = 0, int c2 = 0) : r1(r1), c1(c1), r2(r2), c2(c2) {}
};
const int M = 1e5 + 5;
vector<seg> hor[M];
vector<seg> vert[M];
int colh[M], colv[M];
int c = 0;
void solve() {
    ++c;
    int n, k, m;
    cin >> n >> m >> k;
    dsu.clear();
    vector<rct> r(k);
    for (int i = 0; i < k; ++i) {
        int r1, c1, r2, c2;
        cin >> r1 >> c1 >> r2 >> c2;
        r[i] = {r1, c1, r2, c2};
        if (r1 == r2) {
            hor[r1].emplace_back(c1, c2, i);
        } else {
            vert[c1].emplace_back(r1, r2, i);
        }
    }
    for (auto [r1, c1, r2, c2] : r) {
        if (r1 == r2) {
            if (colh[r1] == c) continue;
            sort(all(hor[r1]));
            colh[r1] = c;
        } else {
            if (colv[c1] == c) continue;
            sort(all(vert[c1]));
            colv[c1] = c;
        }
    }
    dsu.assign(k, -1);
    auto at = [&](int i, int j) {
        auto it = lower_bound(all(hor[i]), seg{j, j, -1});
        if (it != hor[i].end() && it->l <= j) {
            return it->idx;
        }
        it = lower_bound(all(vert[j]), seg{i, i, -1});
        if (it != vert[j].end() && it->l <= i) {
            return it->idx;
        }
        return -1;
    };
    vector<vector<pair<int, int>>> edges(n + 1);
    for (int i = 0; i < k; ++i) {
        for (auto [x, y] : {make_pair(r[i].r1, r[i].c1), make_pair(r[i].r2, r[i].c2)}) {
            for (auto [dx, dy] : {make_pair(-1, 0), make_pair(1, 0), make_pair(0, -1), make_pair(0, 1)}) {
                int j = at(x + dx, y + dy);
                if (j != i && j != -1) {
                    edges[max(x, x + dx)].emplace_back(i, j);
                }
            }
        }
    }
    vector<vector<int>> ev(n + 1);
    vector<int> cnt1(n + 1);
    vector<int> cnt2(n + 1);
    for (auto [r1, c1, r2, c2] : r) {
        if (r1 == r2) {
            ev[r1].emplace_back(c2 - c1 + 1);
        } else {
            cnt1[r1]++;
            cnt2[r2]++;
        }
    }

    int cntv = 0;
    ll cnt_b = 0, cnt_comp = 0;
    for (int i = 1; i <= n; ++i) {
        cntv += cnt1[i];
        cnt_b += cntv;
        cnt_comp += cnt1[i];
        for (int tp : ev[i]) {
            cnt_comp++;
            cnt_b += tp;
        }
        for (auto [a, b] : edges[i]) {
            cnt_comp -= unite(a, b);
        }
        cntv -= cnt2[i];
        cout << cnt_b << ' ' << cnt_comp << '\n';
    }
    for (auto [r1, c1, r2, c2] : r) {
        if (r1 == r2) {
            hor[r1].clear();
        } else {
            vert[c1].clear();
        }
    }
}

int32_t main() {
    if (1) {
        ios::sync_with_stdio(0);
        cin.tie(0);
        cout.tie(0);
    }
#ifdef LOCAL
    freopen("../input.txt", "r", stdin);
    freopen("../output.txt", "w", stdout);
#endif
    int tt;
    cin >> tt;
    while (tt--) solve();
    return 0;
}