#include <bits/stdc++.h> using namespace std; int n,a[100005],m,x[100005],c; int fun(int x){ int l=1,r=n,mid; while(l<=r){ mid=l+(r-l)/2; if(x==a[mid]){ c++; break; } else if(x<a[mid])r=mid-1; else l=mid+1; } if(x==a[mid]){ return a[mid]; } else return -1; } int main(){ scanf("%d",&n); scanf("%d",&m); for(int i=1;i<=n;i++){ scanf("%d",&a[i]); } for(int i=1;i<=m;i++){ scanf("%d",&x[i]); } sort(a+1,a+n+1); sort(x+1,x+m+1); for(int i=1;i<=m;i++){ if(fun(x[i])!=-1)printf("%d",fun(x[i])); cout<<" "; } return 0; }