1
2 2
1 1
1 2
 1
1 3
3
1 2 3
 1
1 1
1000
1000
 1
2 2
2 2
2 2
 5
4 5
10 8 6 4
1 2 3 4 5
1 1
3
3
1 1
3
2
5 3
1000 2 2 2 3
3 1 5
5 5
1 2 3 4 5
1 2 3 4 5
 1
4 4
1 1 1 1
1 2 3 4
 1
2 3
1 1
1 2 3

YES
1 1
 YES
1 3
 YES
1 1000
 YES
1 2
 YES
1 4
YES
1 3
NO
YES
1 3
YES
1 1
 YES
1 1
 YES
1 1

#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
	int t;
	cin>>t;
	while(t--)
	{
		int n,m,i,j=0,k;
		bool check;
		cin>>n>>m;
		if(m>n)
			int a[n]={0};
		else
			int a[m]={0};
		int a[n],b[m];
		for(i=0;i<n;i++)
			cin>>a[i];
		for(i=0;i<m;i++)
			cin>>b[i];
		if(m>n)
		{
			sort(a,a+n);
			for(i=0;i<m;i++)
			{
				check=binary_search(a,a+n,b[i]);
				if(check==true)
				{
					a[j++]=b[i];
				}
			}
		}	
		else
		{
			sort(b,b+m);
			for(i=0;i<m;i++)
			{
				check=binary_search(a,a+n,b[i]);
				if(check==true)
				{
					a[j++]=b[i];
				}
			}
		}
		k=j;
		for(i=0;i<k;i++)
			cout<<a[i]<<" ";
		cout<<endl;
	}
}