#include <bits/stdc++.h>
using namespace std ;
const int N = 1e5 + 5 ;
int n, m ;
int a[N], b[N] ;
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] ;
}
sort (b + 1, b + 1 + m) ;
for (int i = 1; i <= n; i ++) {
int l = 1, r = m, mid ;
while (l < r) {
//cout << "l :" << l << " " << "r :" << r << "\n" ;
mid = (l + r) >> 1 ;
if (b[mid] == a[i]) {
cout << a[i] << " " ;
}
if (b[mid] >= a[i]) {
r = mid ;
} else {
l = mid + 1 ;
}
}
}
}
加特判
?这不对吧