Yet Another Card Deck
You have a card deck of $$$n$$$ cards, numbered from top to bottom, i. e. the top card has index $$$1$$$ and bottom card — index $$$n$$$. Each card has its color: the $$$i$$$-th card has color $$$a_i$$$.You should process $$$q$$$ queries. The $$$j$$$-th query is described by integer $$$t_j$$$. For each query you should:   find the highest card in the deck with color $$$t_j$$$, i. e. the card with minimum index;  print the position of the card you found;  take the card and place it on top of the deck. 
Description of the sample:   the deck is $$$[2, 1, 1, 4, \underline{3}, 3, 1]$$$ and the first card with color $$$t_1 = 3$$$ has position $$$5$$$;  the deck is $$$[3, \underline{2}, 1, 1, 4, 3, 1]$$$ and the first card with color $$$t_2 = 2$$$ has position $$$2$$$;  the deck is $$$[2, 3, \underline{1}, 1, 4, 3, 1]$$$ and the first card with color $$$t_3 = 1$$$ has position $$$3$$$;  the deck is $$$[\underline{1}, 2, 3, 1, 4, 3, 1]$$$ and the first card with color $$$t_4 = 1$$$ has position $$$1$$$;  the deck is $$$[1, 2, 3, 1, \underline{4}, 3, 1]$$$ and the first card with color $$$t_5 = 4$$$ has position $$$5$$$. 
The first line contains two integers $$$n$$$ and $$$q$$$ ($$$2 \le n \le 3 \cdot 10^5$$$; $$$1 \le q \le 3 \cdot 10^5$$$) — the number of cards in the deck and the number of queries.The second line contains $$$n$$$ integers $$$a_1, a_2, \dots, a_n$$$ ($$$1 \le a_i \le 50$$$) — the colors of cards.The third line contains $$$q$$$ integers $$$t_1, t_2, \dots, t_q$$$ ($$$1 \le t_j \le 50$$$) — the query colors. It's guaranteed that queries ask only colors that are present in the deck.
Print $$$q$$$ integers — the answers for each query.
import sys
from collections import deque

def rl():
    return sys.stdin.readline().strip()

def rl_types(types):
    str_list = [x for x in sys.stdin.readline().strip().split(' ')]
    return [types[i](str_list[i]) for i in range(len(str_list))]

def pr(something):
    sys.stdout.write(str(something) + '\n')

def pra(array):
    sys.stdout.write(' '.join([str(x) for x in array]) + '\n')

def solve(array):
    return array
if __name__ == '__main__':
    _ = rl()
    cards = [int(x) for x in rl().split(' ')]
    queries = [int(x) for x in rl().split(' ')]
    outlocs = []
    top_cards = deque()
    first_orig = {}
    for (i, c) in enumerate(cards):
        if c in first_orig:
            continue
        first_orig[c] = i

    def update_first(ith):
        for k in first_orig:
            if first_orig[k] < ith:
                first_orig[k] += 1
    top_set = set()
    for (qi, q) in enumerate(queries):
        if not q in top_set:
            ith = first_orig[q]
            update_first(ith)
            top_cards.appendleft(q)
            top_set.add(q)
        else:
            ''
            ith = top_cards.index(q)
            del top_cards[ith]
            top_cards.appendleft(q)
        outlocs.append(ith + 1)
    pra(outlocs)
import sys
from collections import deque

def rl():
    return sys.stdin.readline().strip()

def rl_types(types):
    str_list = [x for x in sys.stdin.readline().strip().split(' ')]
    return [types[i](str_list[i]) for i in range(len(str_list))]

def pr(something):
    sys.stdout.write(str(something) + '\n')

def pra(array):
    sys.stdout.write(' '.join([str(x) for x in array]) + '\n')

def solve(array):
    return array
if __name__ == '__main__':
    _ = rl()
    cards = [int(x) for x in rl().split(' ')]
    queries = [int(x) for x in rl().split(' ')]
    outlocs = []
    top_cards = deque()
    first_orig = {}
    for (i, c) in enumerate(cards):
        if c in first_orig:
            continue
        first_orig[c] = i

    def update_first(ith):
        for k in first_orig:
            if first_orig[k] < ith:
                first_orig[k] += 1
    top_set = set()
    for (qi, q) in enumerate(queries):
        if not q in top_set:
            ith = first_orig[q]
            update_first(ith)
            top_cards.appendleft(q)
            top_set.add(q)
        else:
            ''
            ith = top_cards.index(q)
            del top_cards[ith]
            top_cards.appendleft(q)
        outlocs.append(ith + 1)
    pra(outlocs)
from collections import deque
(n, q) = map(int, input().split())
arr = deque(map(int, input().split()))
x = list(map(int, input().split()))
ans = []
for i in x:
    tmp = arr.index(i, 0, n)
    ans.append(tmp + 1)
    del arr[tmp]
    arr.appendleft(i)
print(' '.join(map(str, ans)))