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. 

Input

The first line contains two integers n and q (2 ≤ n ≤ 3 ⋅ 10^5; 1 ≤ q ≤ 3 ⋅ 10^5) — the number of cards in the deck and the number of queries.

The second line contains n integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 50) — the colors of cards.

The third line contains q integers t_1, t_2, ..., t_q (1 ≤ t_j ≤ 50) — the query colors. It's guaranteed that queries ask only colors that are present in the deck.

Output

Print q integers — the answers for each query.

Example

Input


7 5
2 1 1 4 3 3 1
3 2 1 1 4


Output


5 2 3 1 5 

Note

Description of the sample: 

  1. the deck is [2, 1, 1, 4, \underline{3}, 3, 1] and the first card with color t_1 = 3 has position 5; 
  2. the deck is [3, \underline{2}, 1, 1, 4, 3, 1] and the first card with color t_2 = 2 has position 2; 
  3. the deck is [2, 3, \underline{1}, 1, 4, 3, 1] and the first card with color t_3 = 1 has position 3; 
  4. the deck is [\underline{1}, 2, 3, 1, 4, 3, 1] and the first card with color t_4 = 1 has position 1; 
  5. the deck is [1, 2, 3, 1, \underline{4}, 3, 1] and the first card with color t_5 = 4 has position 5. 
#include <iostream>
#include <cstdio>
#include <fstream>
#include <algorithm>
#include <cmath>
#include <deque>
#include <vector>
#include <queue>
#include <string>
#include <cstring>
#include <map>
#include <stack>
#include <set>
#define int long long
#define IOS ios_base:sync_with_stdio(0); cin.tie(0);
#define MEM(x,y) memset(x,y,sizeof(x))
#define rep(i , a , b) for(int i = a ; i <= b ; i ++)
#define sc(a) scanf("%lld",&a)
#define pf(a) printf("%lld ",a)
using namespace std;


typedef pair<int, int>pii;

const int N = 3e5 + 200, INF = 0x3f3f3f3f3f3f3f3f, MOD = 1e9 + 7;


int T;


int n, m, k;
int a[N];
int a1[60];
int q1;
signed main() {
	rep(i, 1, 55)a1[i] = INF;
	cin >> n >> q1;
	rep(i, 1, n) {
		cin >> a[i];
		if (a1[a[i]] == INF)a1[a[i]] = i;
	}
	
	while (q1--) {
		int t;
		cin >> t;
		cout << a1[t] << ' ';
		rep(i, 1, 50) {
			if (a1[i] < a1[t])a1[i]++;
		}
		a1[t] = 1;
	}

}