#include <iostream>
#include <cstdio>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cmath>
#include <math.h>
#include <string.h>
#define u using namespace std;
#define ll long long
#define s scanf
#define p printf
#define f for
#define ii int
#define vv void
u
const ll maxn = 1e5+10,maxn2 = 1e9+10;
ll n,m,a[maxn],b[maxn2];
ii main() {
	s("%ld%ld",&n,&m);
	f(ll i = 0;i<n;i++){
		s("%ld",&a[i]);
	}
	f(ll i = 0;i<m;i++){
		s("%ld",&b[i]);
	}
	f(ll i = 0;i<n;i++){
		f(ll j = 0;j<m;j++){
			if(b[j] == a[i])p("%ld ",i+1);
		} 
	}
	return 0;
}