#include<iostream>
#include<cstdio>
#include<string.h>
#include<algorithm>
using namespace std;
typedef struct{
int a,b,c;
}s;
bool cmp(s s1,s s2){
if(s1.a<s2.a)return true;
if(s1.a==s2.a&&s1.b<s2.b)return true;
if(s1.a==s2.a&&s1.b==s2.b&&s1.c<s2.c)return true;
return false;
}
int main()
{
s sum[10000];
int m,n;
scanf("%d",&m);
while(m--)
{
memset(sum,0,sizeof(sum));
int sum1=0,tem;
scanf("%d",&n);
for(int i=0;i<n;i++)
{
scanf("%d%d%d",&sum[i].a,&sum[i].b,&sum[i].c);
}
for(int i=0;i<n;i++)
{
if(sum[i].b<sum[i].c)
{
tem=sum[i].b;
sum[i].b=sum[i].c;
sum[i].c=tem;
}
}
sort(sum,sum+n,cmp);
for(int j=0;j<n;j++)
if(sum[j].a!=sum[j+1].a||sum[j].b!=sum[j+1].b||sum[j].c!=sum[j+1].c)
printf("%d %d %d\n",sum[j].a,sum[j].b,sum[j].c);
}
return 0;
}
#include<cstdio>
#include<string.h>
#include<algorithm>
using namespace std;
typedef struct{
int a,b,c;
}s;
bool cmp(s s1,s s2){
if(s1.a<s2.a)return true;
if(s1.a==s2.a&&s1.b<s2.b)return true;
if(s1.a==s2.a&&s1.b==s2.b&&s1.c<s2.c)return true;
return false;
}
int main()
{
s sum[10000];
int m,n;
scanf("%d",&m);
while(m--)
{
memset(sum,0,sizeof(sum));
int sum1=0,tem;
scanf("%d",&n);
for(int i=0;i<n;i++)
{
scanf("%d%d%d",&sum[i].a,&sum[i].b,&sum[i].c);
}
for(int i=0;i<n;i++)
{
if(sum[i].b<sum[i].c)
{
tem=sum[i].b;
sum[i].b=sum[i].c;
sum[i].c=tem;
}
}
sort(sum,sum+n,cmp);
for(int j=0;j<n;j++)
if(sum[j].a!=sum[j+1].a||sum[j].b!=sum[j+1].b||sum[j].c!=sum[j+1].c)
printf("%d %d %d\n",sum[j].a,sum[j].b,sum[j].c);
}
return 0;
}