#include<bits/stdc++.h>
using namespace std;
int n,m,a[1000000+5],b[1000000+5];
bool check(long long x)
{
	long long l=1,r=m;
	while(l<=r)
	{
		long long mid=b[(l+r)>>1];
		if(x==mid)return 1;
		if(x>mid)l=mid+1;
		else r=mid-1;	
	}
	return 0;
}
int main(void)
{
	cin>>n>>m;
	for(int i=1;i<=n;i++)cin>>a[i];
	for(int j=1;j<=m;j++)cin>>b[j];
	sort(b+1,b+n+1);
	for(int i=1;i<=n;i++)
	{
		if(check(a[i]))cout<<a[i]<<" ";
	}
	return 0;
}

RE了八个点，麻烦大犇指点