#include<bits/stdc++.h>
using namespace std;
const int MAXN = 100005;
int A[MAXN], B[MAXN];
int n, m;
int main() {
    cin >> n >> m;
    for (int i = 0; i < n; ++i) {
        cin >> A[i];
    }
    for (int i = 0; i < m; ++i) {
        cin >> B[i];
    }
    sort(A, A + n);
    vector<int> res;
    for (int i = 0; i < m; ++i) {
        auto it = lower_bound(A, A + n, B[i]);
        if (it != A + n && *it == B[i]) {
            res.push_back(B[i]);
        }
    }
    sort(res.begin(), res.end());
    for (int i = 0; i < res.size(); ++i) {
        if (i > 0) cout << " ";
        cout << res[i];
    }
    cout << endl;

    return 0;
}
/**************************************************************
	Problem: 1898
	User: yangwanning
	Language: C++
	Result: Accepted
	Time:222 ms
	Memory:3712 kb
****************************************************************/