#include<bits/stdc++.h>
using namespace std;
int n,m,a[100005],b[100005],x;
bool t;
void f(int l,int r){
	int mid=(l+r)/2;
	if(l>r)	return;
	if(a[mid]==x){
		t=true;
		return;
	}
	else if(a[mid]>x) f(l,mid-1);
	else f(mid+1,r);
	
}
int main(){
	scanf("%d",&n);
	scanf("%d",&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);
	for(int i=1;i<=m;i++){
		x=b[i];
		t=false;
		f(1,n);	
		if(t) printf("%d ",b[i]);
	}
}
/**************************************************************
	Problem: 1898
	User: linzihang
	Language: C++
	Result: Accepted
	Time:212 ms
	Memory:2860 kb
****************************************************************/