//#pragma GCC optimize("Ofast", "unroll-loops")
//#pragma GCC target("sse", "sse2", "sse3", "ssse3", "sse4")
#ifdef LOCAL
#include <iostream>
#include <cmath>
#include <algorithm>
#include <stdio.h>
#include <cstdint>
#include <cstring>
#include <string>
#include <cstdlib>
#include <vector>
#include <bitset>
#include <map>
#include <queue>
#include <ctime>
#include <stack>
#include <set>
#include <list>
#include <random>
#include <deque>
#include <functional>
#include <iomanip>
#include <sstream>
#include <fstream>
#include <complex>
#include <numeric>
#include <cassert>
#include <array>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <thread>
#else
#include <bits/stdc++.h>
#endif

#define all(a) a.begin(),a.end()
#define len(a) (int)(a.size())
#define mp make_pair
#define pb push_back
#define fir first
#define sec second
#define fi first
#define se second

using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
typedef long double ld;

template<typename T>
inline bool umin(T &a, T b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}

template<typename T>
inline bool umax(T &a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

#ifdef LOCAL
#define D for (bool _FLAG = true; _FLAG; _FLAG = false)
#define LOG(...) print(#__VA_ARGS__" ::", __VA_ARGS__) << endl
template <class ...Ts> auto &print(Ts ...ts) { return ((cerr << ts << " "), ...); }
#else
#define D while (false)
#define LOG(...)
#endif // LOCAL

const int max_n = -1, inf = 1000111222;


struct dsu {
public:
    int n;
    vector <int> p, cnt;

    inline void make_set (int v) {
        p[v] = v;
    }

    dsu (int n) : n(n) {
        p.resize(n);
        cnt.assign(n, 1);
        for (int i = 0; i < n; i++) {
            make_set(i);
        }
    }

    inline int get (int v) {
        if (p[v] == v) return v;
        return p[v] = get(p[v]); /// compressing path
    }

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


inline void test_case () {
    int n, m, k;
    cin >> n >> m >> k;
    vector <vector <pii> > h(n), add(n + 1);
    for (int i = 0, r0, c0, r1, c1; i < k; i++) {
        cin >> r0 >> c0 >> r1 >> c1;
        --r0, --r1, --c0, --c1;
        if (r0 == r1) {
            h[r1].pb({c0, c1});
        }
        else {
            add[r0].pb({c1, 1});
            add[r1 + 1].pb({c1, -1});
        }
    }
    ll cnt = 0;
    int cmp = 0, cur = 0, num = 0;
    vector <pair<pii, int> > last;
    vector <int> id(m, -1);
    dsu t(k);
    for (int i = 0; i < n; i++) {
        vector <pair<pii, int> > have;
        sort(all(add[i]));
        for (auto &j : add[i]) {
            cur += j.second;
            if (j.second == -1) {
                last.pb({{j.first, j.first}, id[j.first]});
                id[j.first] = -1;
            }
            else {
                id[j.first] = num++;
                have.pb({{j.first, j.first}, id[j.first]});
                ++cmp;
            }
        }
        for (auto &j : h[i]) {
            cnt += j.second - j.first + 1;
            ++cmp;
            have.pb({j, num++});
        }
        cnt += cur;
        sort(all(last));
        sort(all(have));
        int p = 0;
        for (auto &j : have) {
            while (p < len(last) && last[p].first.second < j.first.first) {
                ++p;
            }
            while (p < len(last) && last[p].first.second <= j.first.second) {
                if (t.unite(j.second, last[p].second)) {
                    --cmp;
                }
                ++p;
            }
            if (p < len(last) && last[p].first.first <= j.first.second) {
                if (t.unite(j.second, last[p].second)) {
                    --cmp;
                }
            }
            if (j.first.first && id[j.first.first - 1] != -1) {
                if (t.unite(j.second, id[j.first.first - 1])) {
                    --cmp;
                }
            }
            if (j.first.second + 1 < m && id[j.first.second + 1] != -1) {
                if (t.unite(j.second, id[j.first.second + 1])) {
                    --cmp;
                }
            }
        }
        last.swap(have);
        cout << cnt << ' ' << cmp << '\n';
    }
}


int main() {
//    freopen("input.txt", "r", stdin);
//    freopen("output.txt", "w", stdout);

    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    cin >> t;
    for (int test = 1; test <= t; test++) {
        test_case();
    }
}