@vijju123 , @ssjgz , @tmwilliamlin , @everule1

```
#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
// code comes here
int t;
cin>>t;
while(t--)
{
int n;
cin>>n;
int col[n];
vector<vector<int>> v(n);
for(int i=0;i<n;i++)
{
cin>>col[i];
vector<int> temp(col[i]);
for(int j=0;j<col[i];j++)
{
int r;
cin>>r;
temp.push_back(r);
}
v.push_back(temp);
}
for(int i=0;i<n;i++)
{
for(int j=0;j<col[i];j++)
{
cout<<v[i][j]<<" ";
}
cout<<endl;
}
cout<<endl;
/*
int daughter[n],prince[n];
memset(daughter,0,sizeof(daughter));
memset(prince,0,sizeof(prince));
for(int i=0;i<n;i++)
{
for(int j=0;j<col[i];j++)
{
if(daughter[i]==0 && 1<=v[i][j] && v[i][j]<=n && prince[v[i][j]-1]==0)
{
daughter[i]=1;
prince[v[i][j]-1]=1;
break;
}
}
}
int dau=-1,pri=-1;
for(int i=0;i<n;i++)
{
if(daughter[i]==0)
{
dau=i+1;
break;
}
}
for(int i=0;i<n;i++)
{
if(prince[i]==0)
{
pri=i+1;
break;
}
}
if(dau==-1 || pri==-1)
{
cout<<"OPTIMAL"<<endl;
}
else
{
cout<<"IMPROVE"<<endl;
cout<<dau<<" "<<pri<<endl;
}
*/
}
return 0;
}
```