#include<bits/stdc++.h>
using namespace std;
long n,m,a[100000],b[100000],f[100000],t;
int main() {
	cin>>n>>m;
	for(int i=1; i<=n; i++) cin>>a[i];
	for(int j=1; j<=m; j++) cin>>b[j];
	sort(a+1,a+n+1);
	sort(b+1,b+1+m);
	for(int i=1; i<=m; i++){
		int l=1,r=n,mid;
		while(l<=r)
		{
			mid=(l+r)/2;
			if(b[i]==a[mid]){
				cout<<b[i]<<" ";
				break;
			}
			else if(a[mid]<b[i]) l=mid+1;
				 	else r=mid-1;
		}
	}
}