#include
using namespace std;
class node{
public:
int data;
node* next;
node(int d){
data=d;
next=NULL;
}
};
node* Linked_list(node*& head1,int n){
node* tail=NULL;
int d;
cin>>d;
node* x = new node(d);
head1=tail=x;
n=n-1;
while(n–){
cin>>d;
x = new node(d);
tail->next = x;
tail=x;
}
return head1;
}
node* merge(node* a,node* b){
if(a==NULL){
return b;
}
if(b==NULL){
return a;
}
node* c;
if(a->data < b->data){
c = a;
c->next = merge(a->next,b);
}else{
c = b;
c->next = merge(a,b->next);
}
return c;
}
int main() {
int t;
cin>>t;
while(t–){
int n;
cin>>n;
node* head1=NULL;
head1 = Linked_list(head1,n);
node* head2 = NULL;
int m;
cin>>m;
head2 = Linked_list(head2,m);
node* temp = merge(head1,head2);
while(temp!=0){
cout<<temp->data<<" ";
temp=temp->next;
}
}
return 0;
}
