n, m = map(int, input().split())
S = list(map(int, input().split()))
T = list(map(int, input().split()))
dp = [-1] * (m+1)
dp[0] = []
for y in range(n):
    ndp = [-1] * (m+1)
    for x in range(m+1):
        if dp[x] == -1:
            break
        if ndp[x] != -1:
            ndp[x] = min(ndp[x], dp[x]+[S[y]])
        else:
            ndp[x] = dp[x]+[S[y]]
        if x < m and S[y] == T[x]:
            ndp[x+1] = dp[x][:]
    dp = ndp

print(*dp[-1])