#include <cstdio>
#include <vector>
#include <queue>
#include <algorithm>
#include <set>
using namespace std;

typedef struct {
	int x1; int y1; int x2; int y2; int id; int f;
} roof;
int n;
roof roofs[40000];
int next[40000],deg[40000],flow[40000];

typedef struct {
	int x; int y; int t; int id;
} event;
bool operator<(event e1, event e2) {
	if (e1.x==e2.x) {
		if (e1.t==e2.t) {
			if (e1.t==1) return e1.y<e2.y;
			else return e1.y>e2.y;
		} else return e1.t>e2.t;
	} else return e1.x<e2.x;
}
vector<event> events;

int x;
double height(roof r) {
	return r.y1+(double)(x-r.x1)*(r.y2-r.y1)/(r.x2-r.x1);
}
bool operator<(roof r1, roof r2) {
	return height(r1)<height(r2);
}
set<roof> active;
set<roof>::iterator it;

void findLower(roof r) {
	it = active.lower_bound(r);
	if (it!=active.begin()) {
		it--;
		next[r.id]=it->id;
		deg[it->id]++;
	}
}

int main() {
	int tests;
    scanf("%d",&tests);
    while (tests--) {
    	scanf("%d",&n);
    	events.clear();
    	for (int i=0;i<n;i++) {
    		int x1,y1,x2,y2;
			scanf("%d %d %d %d",&x1,&y1,&x2,&y2);
			roofs[i]=(roof){x1,y1,x2,y2,i,0};
			next[i]=-1; deg[i]=0;
			flow[i]=0;
			events.push_back((event){x1,y1,1,i});
			events.push_back((event){x2,y2,-1,i});
    	}
    	sort(events.begin(),events.end());
    	for (int i=0;i<events.size();i++) {
    		event e = events[i];
    		x=e.x;
    		roof r = roofs[e.id];
			if (i>0 && !active.empty()) {
				it=active.end();
				it--;
				flow[it->id]+=events[i].x-events[i-1].x;
			}
			if (e.t==1) {
				if (r.y1<r.y2) findLower(r);
				active.insert(r);
			} else {
				active.erase(r);
				if (r.y1>r.y2) findLower(r);
			}
    	}
    	queue<int> q;
    	for (int i=0;i<n;i++) if (deg[i]==0) {
    		q.push(i);
    	}
    	while (!q.empty()) {
			int id=q.front(); q.pop();
			int nid=next[id];
			if (nid==-1) continue;
			flow[nid]+=flow[id];
			if (--deg[nid] == 0) q.push(nid);
    	}
    	for (int i=0;i<n;i++) {
			printf("%d\n",flow[i]);
    	}
    	if (tests!=0) printf("\n");
    }
    return 0;
}