#include <bits/stdc++.h>
using namespace std;

int main(){
    int N, M; cin >> N >> M;
    vector<int> S(N); for (int i = 0; i < N; i++) cin >> S[i];
    vector<int> T(M); for (int j = 0; j < M; j++) cin >> T[j];
    vector dp(M + 1, vector<int>(1, 1e9));
    dp[0] = {};
    for (int i = 0; i < N; i++){
        for (int j = M; j >= 0; j--){
            dp[j].push_back(S[i]);
            if (j > 0 && S[i] == T[j - 1]){
                dp[j] = min(dp[j - 1], dp[j]);
            }
        }
    }
    for (auto x : dp[M]) cout << x << ' ';
    cout << endl;
}