#include <bits/stdc++.h>
using namespace std;
int a[10000010],b[10000010],k;
int erfen(int x,int y){
	int l=x,r=y;
	while(l<=r){
		int mid = (l+r)/2;
		if(a[mid]<k){
			l = mid+1;
		}else if(a[mid] > k){
			r = mid-1;
		}else{
		    return mid;
		}
	}
	return -1;
}
int main(){
    int n,m,a1,a2;
    cin>>n>>m;
    for(int i=1;i<=n;i++){
        cin>>a1;
    }
    for(int i=1;i<=m;i++){
        cin>>a2;
    }
    sort(a+1,a+1+n);
    for(int i=1;i<=n;i++){
        if(b[a1]==a[i]){
            cout<<a[i]<<" ";
        }
    }
	return 0;
}