void q_sort(int low,int high)//快排
{
	if(low>high)return;
	int temp = g[low];
	int l=low,r=high;
	while(l!=r)
	{
		while(g[r]>=temp&&l<r)r--;
		while(g[l]<=temp&&l<r)l++;
		if(l<r)swap(g[l],g[r]);
	}
	g[low]=g[l];
	g[l]=temp;
	q_sort(low,l-1);
	q_sort(l+1,high);
}

int find(int x)//二分查找
{
	int l=0,r=m-1;
	while(l <= r)
	{
		int mid = (l+r+1)/2;
		if(g[mid]>=x)r=mid-1;
		else l=mid+1;
	}
	if(g[l]==x&&l<m&&l>=0)return l;
	return -1;
}

#include <bits/stdc++.h>
using namespace std;
int k[100001],g[100001];
int n,m;
int find(int x)//二分查找
{
	int l=0,r=m-1;
	while(l <= r)
	{
		int mid = (l+r+1)/2;
		if(g[mid]>=x)r=mid-1;
		else l=mid+1;
	}
	if(g[l]==x&&l<m&&l>=0)return l;
	return -1;
}
void q_sort(int low,int high)//快排
{
	if(low>high)return;
	int temp = g[low];
	int l=low,r=high;
	while(l!=r)
	{
		while(g[r]>=temp&&l<r)r--;
		while(g[l]<=temp&&l<r)l++;
		if(l<r)swap(g[l],g[r]);
	}
	g[low]=g[l];
	g[l]=temp;
	q_sort(low,l-1);
	q_sort(l+1,high);
}
int main()
{
	cin>>n>>m;
	for(int i=0;i<n;i++)scanf("%d",&k[i]);
	for(int i=0;i<m;i++)scanf("%d",&g[i]);
	int j=0;
	int gcc[n];
	q_sort(0,m-1);
	for(int i=0;i<n;i++)
	{
		int temp = find(k[i]);
		if(temp!=-1)gcc[j++]=k[i];
	}
	for(int i=0;i<j;i++)
	{
		if(i!=j-1)cout<<gcc[i]<<" ";
		else cout<<gcc[i];
	}
	return 0;
}