#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define x first
#define y second
#define endll "\n"
#pragma GCC optimize(1)
#pragma GCC optimize(2)
#define ull unsigned long long
#define rep(i,b) for(int i=0;i<b;i++)
#define For(i, a, b) for(int i=a;i<=b;i++)
#define Rof(i, a, b) for(int i=a;i>=b;i--)
#define rest(a, b) memset(a,b, sizeof(a));
#define recopy(a, b) memcpy(b, a, sizeof(a));
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
int gcd(int a, int b) {while (b ^= a ^= b ^= a %= b);return a;}//最大公约数
ll gcd(ll a, ll b) {while (b ^= a ^= b ^= a %= b);return a;}
const int inf = 0x3f3f3f3f;
const int mod = 1e9;
const int N=1e5;
const int maxx=1e7;
int n,q;
int idx[100];
int main() {
    IOS;
    cin >> n >> q;
    for(int i = 1 ; i <= n ; i ++)
    {
        int x;
        cin >> x;
        if(!idx[x]) idx[x] = i;
    }
    while(q --)
    {
        int p;
        cin >> p;
        cout << idx[p] << " ";
        for(int i = 1 ; i <= 50 ; i ++)
            if(idx[i] < idx[p])
                idx[i] ++;
        idx[p] = 1;
    }

    return 0;
}
