#include <bits/stdc++.h>

#define long long long int
#define DEBUG
using namespace std;

// @author: pashka

struct Dsu {

    vector<int> p;

    Dsu(int n) {
        p.resize(n);
        for (int i = 0; i < n; i++) p[i] = i;
    }

    int get(int x) {
        if (p[x] != x) p[x] = get(p[x]);
        return p[x];
    }

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

struct test {
    void solve() {
        int n, m, k;
        cin >> n >> m >> k;
        vector<int> x1(k), x2(k), y1(k), y2(k);
        for (int i = 0; i < k; i++) {
            cin >> x1[i] >> y1[i] >> x2[i] >> y2[i];
            x1[i]--, x2[i]--, y1[i]--, y2[i]--;
        }
        vector<long> res1(n + 1);
        {
            for (int i = 0; i < k; i++) {
                int d = y2[i] - y1[i] + 1;
                res1[x1[i]] += d;
                res1[x2[i] + 1] -= d;
            }
            for (int i = 1; i <= n; i++) {
                res1[i] += res1[i - 1];
            }
            for (int i = 1; i <= n; i++) {
                res1[i] += res1[i - 1];
            }
        }

        vector<long> res2(n + 1);
        for (int i = 0; i < k; i++) {
            res2[x1[i]]++;
        }

        {
            vector<int> yy;
            for (int i = 0; i < k; i++) {
                yy.push_back(y1[i]);
                yy.push_back(y1[i] - 1);
                yy.push_back(y1[i] + 1);
                yy.push_back(y2[i]);
                yy.push_back(y2[i] - 1);
                yy.push_back(y2[i] + 1);
            }
            sort(yy.begin(), yy.end());
            yy.erase(unique(yy.begin(), yy.end()), yy.end());
            m = yy.size();
            for (int i = 0; i < k; i++) {
                y1[i] = lower_bound(yy.begin(), yy.end(), y1[i]) - yy.begin();
                y2[i] = lower_bound(yy.begin(), yy.end(), y2[i]) - yy.begin();
            }
        }

        vector<vector<pair<int, int>>> e(n + 1);
        {
            vector<set<pair<int, int>>> xx(n);
            for (int i = 0; i < k; i++) {
                xx[x1[i]].insert({y1[i], i});
                xx[x1[i]].insert({y2[i], i});
                xx[x2[i]].insert({y1[i], i});
                xx[x2[i]].insert({y2[i], i});
            }
            for (int i = 0; i < k; i++) {
                if (x1[i] > 0) {
                    int yy = y1[i];
                    while (true) {
                        auto p = xx[x1[i] - 1].find({yy, 0});
                        if (p == xx[x1[i] - 1].end() || p->first > y2[i]) break;
                        e[x1[i]].push_back({i, p->second});
                        yy = p->first + 1;
                    }
                }
                if (x2[i] < n - 1) {
                    int yy = y1[i];
                    while (true) {
                        auto p = xx[x2[i] + 1].find({yy, 0});
                        if (p == xx[x2[i] + 1].end() || p->first > y2[i]) break;
                        e[x2[i] + 1].push_back({i, p->second});
                        yy = p->first + 1;
                    }
                }
            }
        }
        {
            vector<set<pair<int, int>>> yy(m);
            for (int i = 0; i < k; i++) {
                if (x1[i] == x2[i]) {
                    yy[y1[i]].insert({x1[i], i});
                    yy[y2[i]].insert({x1[i], i});
                    yy[y1[i]].insert({x2[i], i});
                    yy[y2[i]].insert({x2[i], i});
                }
            }
            for (int i = 0; i < k; i++) {
                if (y1[i] > 0) {
                    int xx = x1[i];
                    while (true) {
                        auto p = yy[y1[i] - 1].find({xx, 0});
                        if (p == yy[y1[i] - 1].end() || p->first > x2[i]) break;
                        e[p->first].push_back({i, p->second});
                        xx = p->first + 1;
                    }
                }
                if (y2[i] < m - 1) {
                    int xx = x1[i];
                    while (true) {
                        auto p = yy[y2[i] + 1].find({xx, 0});
                        if (p == yy[y2[i] + 1].end() || p->first > x2[i]) break;
                        e[p->first].push_back({i, p->second});
                        xx = p->first + 1;
                    }
                }
            }
        }

        Dsu dsu(k);

        for (int i = 0; i < n; i++) {
            for (auto [x, y]: e[i]) {
                if (dsu.unite(x, y)) {
                    res2[i]--;
                }
            }
        }

        for (int i = 1; i <= n; i++) {
            res2[i] += res2[i - 1];
        }

        for (int i = 0; i < n; i++) {
            cout << res1[i] << " " << res2[i] << "\n";
        }
    }
};

int main() {
    ios::sync_with_stdio(false);

    int n;
    cin >> n;
    for (int i = 0; i < n; i++) {
        test().solve();
    }

    return 0;
}