#include<bits/stdc++.h>
using namespace std;

int main()
{
	long long a[1000000005],b[1000000005],i,n,m,x,low,high,mid;
	cin>>n>>m;
	if(n==0||m==0)
		return 0;
	for(i=1;i<=n;i++)cin>>a[i];
	for(i=1;i<=m;i++)cin>>b[i];
	sort(b+1,b+n+1);
	for(i=1;i<=n;i++)
	{
		x=a[i];
		low=1;
		high=m;
		mid=(low+high)/2;
		while(low<=high&&b[mid]!=x)
		{
			mid=(low+high)/2;
			if(b[mid]>x)
				high=mid-1;
			else
				low=mid+1;
		}
		if(b[mid]==x)
			cout<<x<<' ';
	}	
		
}