#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
int n,m,a[101000],b[101000];
int main(){
	scanf("%d%d",&n,&m);
	for (int i=1;i<=n;i++)scanf("%d",&a[i]);
	for (int i=1;i<=m;i++)scanf("%d",&b[i]);
	sort(a+1,a+n+1);sort(b+1,b+m+1);
	int l=1,r=n,mid;
	for (int i=1;i<=m;i++){
		while(l<r){
			mid=(l+r)/2;
			if (b[i]==a[mid])cout<<b[i]<<" ";
			if (b[i]>a[mid])l=mid;
			else r=mid;
		}
	}
	return 0;
}