#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5 + 5;
int T, n, m, K, ans, r1[N], c1[N], r2[N], c2[N], fa[N], now[N];
ll s[N]; vector <int> r[N], in[N], out[N];
int find(int u) { return u == fa[u] ? u : fa[u] = find(fa[u]); }
void merge(int u, int v) {
	if ((u = find(u)) ^ (v = find(v)))
		fa[v] = u, ans --;
}
int main() {
	cin >> T;
	while (T --) {
		scanf ("%d%d%d", &n, &m, &K), ans = 0;
		for (int i=0; i<=n; i++)
			s[i] = 0, r[i]. clear(), in[i]. clear(), out[i]. clear();
		for (int i=1; i<=K; i++) {
			scanf ("%d%d%d%d", &r1[i], &c1[i], &r2[i], &c2[i]), fa[i] = i;
			if (r1[i] == r2[i]) s[r1[i]] += c2[i] - c1[i] + 1, s[r1[i]+1] -= c2[i] - c1[i] + 1, r[r1[i]]. push_back(i);
			else s[r1[i]] ++, s[r2[i]+1] --, in[r1[i]-1]. push_back(i), out[r2[i]]. push_back(i);
		}
		for (int i=1; i<=n; i++) s[i] += s[i-1];
		for (int i=1; i<=n; i++) {
			printf ("%lld ", s[i] += s[i-1]);
			ans += r[i]. size() + in[i-1]. size();
			sort (r[i]. begin(), r[i]. end(), [] (const int &i, const int &j) { return c1[i] < c1[j]; });
			if (r[i-1]. size()) {
				int j = 0, _ = r[i-1]. size();
				for (int k : r[i]) {
					while (j < _ && c2[r[i-1][j]] < c1[k]) j ++;
					while (j < _ && c2[k] >= c1[r[i-1][j]]) merge(r[i-1][j++], k);
					if (j) j --;
				}
				for (int k : in[i-1]) {
					auto t = lower_bound (r[i-1]. begin(), r[i-1]. end(), c1[k], [] (const int &i, const int &j) { return c2[i] < j; });
					if (t != r[i-1]. end() && c1[*t] <= c1[k]) merge(* t, k);
				}
			}
			if (r[i]. size()) {
				int l = 0;
				for (int k : r[i]) {
					if (l && c1[k] - 1 == c2[l]) merge(l, k);
					l = k;
				}
				for (int k : out[i-1]) {
					auto t = lower_bound (r[i]. begin(), r[i]. end(), c1[k], [] (const int &i, const int &j) { return c2[i] < j; });
					if (t != r[i]. end() && c1[*t] <= c1[k]) merge(* t, k);
				}
			}
			for (int k : in[i-1]) if (now[c1[k]]) merge(now[c1[k]], k);
			for (int k : out[i-1]) now[c1[k]] = 0;
			for (int k : in[i-1]) now[c1[k]] = k;
			for (int k : in[i-1]) {
				if (now[c1[k]-1]) merge(now[c1[k]-1], k);
				if (now[c2[k]+1]) merge(now[c2[k]+1], k);
			}
			for (int k : r[i]) {
				if (now[c1[k]-1]) merge(now[c1[k]-1], k);
				if (now[c2[k]+1]) merge(now[c2[k]+1], k);
			}
			printf ("%d\n", ans);
		}
		for (int k : out[n]) now[c1[k]] = 0;
	}
}