#include <bits/stdc++.h>
using namespace std;
int k[10010],t[10010];
int n,m;
int main()
{
	cin >> n >> m;
	for (int i=1;i<=n;i++)
	{
		cin >> k[i];
	}
	for (int i=1;i<=m;i++)
	{
		cin >> t[i];
	}
	sort(t+1,t+m+1);
	for (int i=1;i<=n;i++)
	{
		int flag = k[i];
        int l=1,r=m;
        while (l<=r)
        {
        	int mid = (l+r)/2;
        	if (t[mid] == flag)
        	{
        		cout << flag << ' ';
        		break;
			}
			else if(t[mid] > flag)
			{
				r = mid-1;
			}
			else if(t[mid] < flag)
			{
				l = mid+1;
			}
		}
	}
	return 0;
}