#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <queue>
#include <vector>
using namespace std;

int n,m,a[500005],b[500005];

int Binary_search(int x,int arr[],int n){
	stable_sort(arr,arr+n);
	int l=1,r=n,mid=(l+r)>>1;
	while(l<=r){
		mid=(l+r)>>1;
		if(arr[mid]>x){
			r=mid-1;
		}if(arr[mid]<x){
			l=mid+1;
		}
		if(arr[mid]==x) return mid;
		
	}
	return -1;
}

int main(){
	cin>>n>>m;
	for(int i=1;i<=n;i++) cin>>a[i];
	for(int i=1;i<=m;i++) cin>>b[i];
	stable_sort(b+1,b+m+1);
	for(int i=1;i<=n;i++){
		if(Binary_search(a[i],b,m)!=-1){
			cout<<a[i]<<' ';
		}
	}
    return 0;
}

TLE point #2#8#9#10