#include<iostream>
#include<algorithm>
#define ywj(a) freopen(#a".in","r",stdin); //freopen(#a".out","w",stdout);
#define wlp ios::sync_with_stdio(false);
#define f1(i,a,b) for(int i=a;i<=b;i++)
#define f2(i,a,b) for(int i=a;i>=b;i--)
#define maxn 100005
using namespace std;
int a[maxn],b[maxn];
int a1[maxn],b1[maxn];
int ans[maxn];
int finds(int x[],int l,int r,int v){
    int m;
    while(l<r){
        m=l+(r-l)/2;
        if(x[m]==v) return m;
        else if(x[m]>v) r=m;
        else l=m+1;
    }
    return -1;
}
int main(){
//  ywj(1571)
    wlp;
    int j=0;
    int n,m;
    cin>>n>>m;
    f1(i,1,n){cin>>a[i];a1[i]=a[i];}
    f1(i,1,m){cin>>b[i];b1[i]=b[i];}
    sort(b+1,b+m+1);

    f1(i,1,n){
        int x=finds(b,1,m,a[i]);
        if(x!=-1) ans[++j]=a[i];
    }
    sort(ans+1,ans+j+1);
    f1(i,1,n){
        int x=finds(ans,1,j+1,a1[i]);
        if(x!=-1) cout<<a1[i]<<" ";
    }
    return 0;
}