Vasya has got n books, numbered from 1 to n, arranged in a stack. The topmost book has number a_1, the next one — a_2, and so on. The book at the bottom of the stack has number a_n. All numbers are distinct.

Vasya wants to move all the books to his backpack in n steps. During i-th step he wants to move the book number b_i into his backpack. If the book with number b_i is in the stack, he takes this book and all the books above the book b_i, and puts them into the backpack; otherwise he does nothing and begins the next step. For example, if books are arranged in the order [1, 2, 3] (book 1 is the topmost), and Vasya moves the books in the order [2, 1, 3], then during the first step he will move two books (1 and 2), during the second step he will do nothing (since book 1 is already in the backpack), and during the third step — one book (the book number 3). Note that b_1, b_2, ..., b_n are distinct.

Help Vasya! Tell him the number of books he will put into his backpack during each step.

Input

The first line contains one integer n~(1 ≤ n ≤ 2 ⋅ 10^5) — the number of books in the stack.

The second line contains n integers a_1, a_2, ..., a_n~(1 ≤ a_i ≤ n) denoting the stack of books.

The third line contains n integers b_1, b_2, ..., b_n~(1 ≤ b_i ≤ n) denoting the steps Vasya is going to perform.

All numbers a_1 ... a_n are distinct, the same goes for b_1 ... b_n.

Output

Print n integers. The i-th of them should be equal to the number of books Vasya moves to his backpack during the i-th step.

Examples

Input

3
1 2 3
2 1 3


Output

2 0 1 


Input

5
3 1 4 2 5
4 5 1 3 2


Output

3 2 0 0 0 


Input

6
6 5 4 3 2 1
6 5 3 4 2 1


Output

1 1 2 0 1 1 

Note

The first example is described in the statement.

In the second example, during the first step Vasya will move the books [3, 1, 4]. After that only books 2 and 5 remain in the stack (2 is above 5). During the second step Vasya will take the books 2 and 5. After that the stack becomes empty, so during next steps Vasya won't move any books.
import java.io.*;
import java.util.*;
import java.math.*;
import java.text.*;
import java.util.regex.*;
public final class Main extends Thread{
	final long MOD = 1000000000L + 7L;
	
	@Override
	public void run(){try{solve();}catch(Exception e){pl(e);}}
	public static void main(String[] args)throws Exception{new Main().solve();}
	
	void solve()throws Exception{
		int n = ni();
		HashMap<Integer, Integer> map = new HashMap<Integer, Integer>();
		StringBuilder ans = new StringBuilder("");
		for(int i=0; i<n; i++){map.put(ni(), i);}
		int lastIndex = -1;
		for(int i=0; i<n; i++){
			int elem = ni();
			int elemInd = map.get(elem);
			if(lastIndex > elemInd){
				ans.append(0).append(" ");
			}else{
				ans.append(elemInd - lastIndex).append(" ");
				lastIndex = elemInd;
			}
		}
		pl(ans);
	}
	
	//----------------------------------------------------------------------------------------------------------------//
	//----------------------------------------------------------------------------------------------------------------//
	int gcd(int a, int b){return BigInteger.valueOf(a).gcd(BigInteger.valueOf(b)).intValue();}
	
	InputStream is = System.in;
	PrintStream ps = new PrintStream(System.out);
	int bytes_buffered = 0, ptr_position = 0;
	byte[] buffer = new byte[1024];
	
	byte nextByte()throws Exception{
		if(bytes_buffered == -1)return -1;
		if(ptr_position >= bytes_buffered){
			ptr_position = 0;
			bytes_buffered = is.read(buffer);
		}
		if(bytes_buffered == -1)return -1;
		return buffer[ptr_position++];
	}
	boolean isSpaceChar(int c)throws Exception{return !(c>=33 && c<=126);}
	byte skip()throws Exception{byte b;while((b = nextByte()) != -1 && isSpaceChar(b)){};return b;}
	int ni()throws Exception{
		int num = 0, b;
		boolean minus = false;
		int fc = skip();
		if(fc == '-'){
			minus = true;
		}else{
			num = num * 10 + (fc - '0');
		}
		while(true){
			b = nextByte();
			if(!isSpaceChar(b)){
				num = num * 10 + (b - '0');
			}else{
				break;
			}
		}
		return minus ? -num : num;
	}
	long nl()throws Exception{
		long num = 0;int b;
		boolean minus = false;
		int fc = skip();
		if(fc == '-'){
			minus = true;
		}else{
			num = num * 10l + (fc - '0');
		}
		while(true){
			b = nextByte();
			if(!isSpaceChar(b)){
				num = num * 10l + (b - '0');
			}else{
				break;
			}
		}
		return minus ? -num : num;
	}
	char nc()throws Exception{return (char)nextByte();}
	String nt(Integer... i)throws Exception{
		StringBuilder sb;
		if(i.length != 0){
			sb = new StringBuilder(i[0]);
		}else{
			sb = new StringBuilder();
		}
		int c = skip();
		sb.appendCodePoint(c);
		while(true){
			c = nextByte();
			if(!isSpaceChar(c)){
				sb.appendCodePoint(c);
			}else{
				return sb.toString();
			}
		}
	}
	String ns(Integer... i)throws Exception{
		StringBuilder sb;
		if(i.length != 0){
			sb = new StringBuilder(i[0]);
		}else{
			sb = new StringBuilder();
		}
		int c = skip();
		sb.appendCodePoint(c);
		while(true){
			c = nextByte();
			if(!isSpaceChar(c) || c == ' '){
				sb.appendCodePoint(c);
			}else{
				return sb.toString();
			}
		}
	}
	double nd()throws Exception{return Double.parseDouble(nt());}
	char[][] map(int n, int m)throws Exception{
		char[][] mp = new char[n][m];
		for(int i=0; i<n; i++){mp[i] = nt().toCharArray();}
		return mp;
	}
	int[] nia(int n)throws Exception{int[] a = new int[n]; for(int i=0; i<n; i++)a[i] = ni(); return a;}
	long[] nla(int n)throws Exception{long[] a = new long[n]; for(int i=0; i<n; i++)a[i] = nl(); return a;}
	
	void p(Object o){ps.print(o);}
	void pl(Object o){ps.println(o);}
	//----------------------------------------------------------------------------------------------------------------//
	//----------------------------------------------------------------------------------------------------------------//
}