#include<bits/stdc++.h>
using namespace std;
const int maxn=50005;
struct date{
    int b[5],val,id;
}a[maxn];
inline bool operator == (date x,date y){
    return x.b[0]==y.b[0] && x.b[1]==y.b[1] && x.b[2]==y.b[2] && x.b[3]==y.b[3] && x.b[4]==y.b[4];
}
inline bool operator <= (date x,date y){
    return x.b[0]<=y.b[0] && x.b[1]<=y.b[1] && x.b[2]<=y.b[2] && x.b[3]<=y.b[3] && x.b[4]<=y.b[4];
}
int czc;
inline bool cmp(date x,date y){
    return x.b[czc]>y.b[czc];
}
inline bool cmp2(date x,date y){
    return x.id<y.id;
}
int MX[maxn/14+5][1<<14],f[maxn];
unsigned short pre[maxn][maxn/14+1];
unsigned short can[maxn/14+1];
inline void solve(){
    int n;
    cin>>n;
    for(int i=1;i<=n;i++){
        for(int j=0;j<5;j++)
            cin>>a[i].b[j];
        cin>>a[i].val;
        a[i].id=i;
    }
    int block=14,mx=(n-1)/block+1;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=mx;j++){
            int l=(j-1)*block+1,r=min(j*block,n);
            pre[i][j]=(1<<(r-l+1))-1;
        }
    }
    for(int k=0;k<5;k++){
        czc=k;
        sort(a+1,a+n+1,cmp);
        for(int j=1;j<=mx;j++){
            int l=(j-1)*block+1,r=min(j*block,n);
            can[j]=(1<<(r-l+1))-1;
        }
        for(int i=1,j=1;i<=n;i=j){
            while(a[j]==a[i]){
                for(int k=1;k<=mx;k++){
                    pre[j][k]&=can[k];
                }
                j++;
            }
            j=i;
            while(a[j]==a[i]){
                for(int k=1;k<=mx;k++){
                    int l=(k-1)*block+1,r=min(k*block,n);
                    if(l<=a[j].id && a[j].id<=r){
                        int s=(( 1<<(a[j].id-l) )-1) | ( ~ ( (1<<(a[j].id-l+1)-1) ) );
                        can[k]&=s;
                    }
                }
                j++;
            }
        }

    }
    sort(a+1,a+n+1,cmp2);
    for(int i=1;i<=mx;i++){
        int l=(i-1)*block+1,r=min(i*block,n);
        for(int j=l;j<=r;j++){
            f[j]=a[j].val;
            for(int k=l;k<j;k++)
                if(a[k]<=a[j]) f[j]=max(f[j],f[k]+a[j].val);
            for(int k=1;k<i;k++)
                f[j]=max(f[j],MX[k][pre[j][k]]);
            cout<<f[j]<<endl;
        }
        if(i==n) continue;
        MX[i][0]=0;
        for(int s=1;s<(1<<block);s++)
            MX[i][s]=max(MX[i][s^(s&-s)],f[l+__builtin_ctz(s)]);
    }
}
int main(){
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    int T;
    cin>>T;
    while(T--){
        solve();
    }
}