#include <bits/stdc++.h>
#define ll long long
using namespace std;
ll f1[100005];
ll f2[100005];
int n, m;
int binarySearch(int target)
{
    int left = 0;
    int right = m - 1; 
    while (left <= right)
    {
        int mid = left + (right - left) / 2;
        if (f2[mid] == target)
            return mid;
        else if (f2[mid] < target)
            left = mid + 1; 
        else if (f2[mid] > target)
            right = mid - 1; 
    }
    return -1;
}
int main()
{
    cin >> n >> m;
    for (int i = 1; i <= n; i++)
        cin >> f1[i];
    for (int i = 1; i <= m; i++)
        cin >> f2[i];
    sort(f2 + 1, f2 + m + 1);
    for (int i = 1; i <= n; i++)
    {
        int s = binarySearch(f1[i]);
        if (s == -1) continue;
        else {
            cout << f2[s] << ' ';
        }
    }
    return 0;
}