#include<bits/stdc++.h>
#define LL long long
#define Un unsigned
#define For1(i,a,b) for(i=(a);i<=(b);++i) 
#define For2(i,a,b) for(i=(a);i<(b);++i) 
#define FoR1(i,a,b) for(i=(a);i>=(b);--i) 
#define FoR2(i,a,b) for(i=(a);i>(b);--i) 
#define For_L(i,x) for(int i=ft[x];i;i=nt[i])
#define fir first
#define sec second
#define mkp std::make_pair 
#define pii std::pair<int,int>
#define pb emplace_back
#define il inline
template<class T1>
il void cmax(T1&x,T1 y){if(x<y)x=y;}
template<class T1>
il void cmin(T1&x,T1 y){if(x>y)x=y;}
#define dbg(x...) fprintf(stderr,x)
#define FI using std::cin;std::ios::sync_with_stdio(0),cin.tie(0)
const int N=50011;
struct pnt{
	int x[5]={0};
	int w;
};
struct pnt_{
	pnt x;int id;
};
struct Cmp{
	int num;
	bool operator()(const pnt_ &x,const pnt_ &y)const{
		return x.x.x[num]<y.x.x[num];
	}
};
bool is(const pnt &x,const pnt &y){
	return x.x[0]<=y.x[0]&&x.x[1]<=y.x[1]&&x.x[2]<=y.x[2]&&x.x[3]<=y.x[3]&&x.x[4]<=y.x[4];
}
struct kdtnd{
	pnt mx,mn;
	int w;
};
template<class T1>
il T1 max(T1 x,T1 y){return(x<y)?y:x;}
template<class T1>
il T1 min(T1 x,T1 y){return(x>y)?y:x;}
Cmp cmp[5];
int id[N];
struct KDT{
	#define lsn o<<1,lt,mid
	#define rsn o<<1|1,mid+1,rt
	static const int SZ=1<<(int)log2(N)+2|5;
	pnt_ a[N];
	kdtnd tr[SZ];
	pnt L;int R,V,res;
	void B(int o,int lt,int rt,int di=0){
		if(lt==rt){
			tr[o].mx=tr[o].mn=a[lt].x;
			id[a[lt].id]=o;
			//printf("ID%d %d\n",a[lt].id,lt);
			return;
		}
		int mid=lt+rt>>1;
		std::nth_element(a+lt,a+mid,a+rt+1,cmp[di]);
		B(lsn,(di==4)?0:di+1);
		B(rsn,(di==4)?0:di+1);
		int i;
		For1(i,0,4){
			tr[o].mx.x[i]=max(tr[o<<1].mx.x[i],tr[o<<1|1].mx.x[i]);
			tr[o].mn.x[i]=min(tr[o<<1].mn.x[i],tr[o<<1|1].mn.x[i]);
		}
	}
	void M(int o){
		tr[o].w=V;
		while(o){
			o>>=1;
			tr[o].w=max(tr[o<<1].w,tr[o<<1|1].w);
		}
	}
	void Q(int o,int lt,int rt){
		//dbg("Q%d [%d,%d]\n",o,lt,rt);
		if(is(tr[o].mx,L)){
			//dbg("OK%d\n",tr[o].w);
			cmax(res,tr[o].w);
			return;
		}
		if(!is(tr[o].mn,L)){
			//dbg("G%d %d;%d %d;%d %d;%d %d;%d %d",tr[o].mn.x[0],L.x[0],tr[o].mn.x[1],L.x[1],tr[o].mn.x[2],L.x[2],tr[o].mn.x[3],L.x[3],tr[o].mn.x[4],L.x[4]);
			//dbg("G%d\n",tr[o].w);
			return;
		}
		int mid=lt+rt>>1;
		if(tr[o<<1].w>tr[o<<1|1].w){
			if(res<tr[o<<1].w)Q(lsn);
			if(res<tr[o<<1|1].w)Q(rsn);
		}
		else{
			if(res<tr[o<<1|1].w)Q(rsn);
			if(res<tr[o<<1].w)Q(lsn);
		}
	}
};
pnt a[N];
KDT kdt;
int T, n;
int main(){FI;int i,j,t1; 
	cin>>T;
	while (T--) {
		kdt = {};
		For1(i,0,4)cmp[i].num=i;
		cin>>n;
		For1(i,1,n){
			For1(j,0,4)cin>>a[i].x[j];
			cin>>a[i].w;
		}
		For1(i,1,n)kdt.a[i].x=a[i],kdt.a[i].id=i;
		kdt.B(1,1,n);
		For1(i,1,n){
			t1=a[i].w;
			kdt.L=a[i];
			//For1(j,0,4)dbg("%d%c",a[i].x[j]," \n"[j==4]);
			kdt.res=0;
			kdt.Q(1,1,n);
			printf("%d\n",t1+=kdt.res);
			kdt.V=t1;
			kdt.M(id[i]);
		}
	}
}