#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
int a[100001],b[100001];

int main(){
    int n,m;
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;++i)scanf("%d",&a[i]);
    for(int i=1;i<=m;++i)scanf("%d",&b[i]);
    sort(a+1,a+n+1);
    sort(b+1,b+m+1);
    for(int i=1;i<=n;++i){
        int opt=a[i];
        int l=1,r=m;
        while(l<=r){
            int mid=(l+r)/2;
            if(b[mid]==opt){
                printf("%d ",opt);
                break;
            }
            else if(b[mid]>opt)r=mid-1;
            else if(b[mid]<opt)l=mid+1;
        }
    }
    return 0;
}

水题都写不对了