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.util.ArrayList;
import java.util.LinkedHashMap;
import java.util.List;
import java.util.Arrays;
import java.util.Collections;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.BufferedReader;
import java.util.LinkedList;
import java.util.Locale;
import java.util.Iterator;
import java.util.Stack;
import java.util.Set;
import java.util.HashSet;
import java.util.TreeSet;
import java.util.Map;
import java.util.HashMap;
import java.util.TreeMap;
import java.util.BitSet;
import java.lang.StringBuilder;
import java.util.Queue;
import java.util.Objects;
import java.util.PriorityQueue;
public class UvaProblems {

    public static void main(String[] args) throws Exception {
        BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
        PrintWriter out = new PrintWriter(System.out);
        Locale.setDefault(new Locale("en", "US"));
        
        /*int n = Integer.parseInt(in.readLine());
        String s = in.readLine();
        ArrayList<String> substrings = new ArrayList<>();
        boolean encontrado = false;
        for(int i = 0; i<n && !encontrado; i++) {
        	for(int j = i+1; j <= n && !encontrado; j++) {
        		if(esDiverse(s.substring(i,j),s.substring(i,j).length())){
        		 	  out.println("YES");
        		 	  out.println(s.substring(i,j));
        		 	  encontrado = true;
        		  }
        	}
        }
        if(!encontrado)
        	out.println("NO");*/
        
        int n = Integer.parseInt(in.readLine());
        LinkedList<Integer> libros = new LinkedList<>();
        int[] orden = new int[n]; 
        String[] b = in.readLine().split(" ");
        HashSet<Integer> sacados = new HashSet<>();
        for(int i = 0; i<n; i++) {
        	libros.add(Integer.parseInt(b[i]));
        }
        
        b = in.readLine().split(" ");
        /*for(int i = 0; i<n; i++) {
        	orden[i] = Integer.parseInt(b[i]);
        }*/
        
        int siguiente, librosSacados, cont = 0;
        for(int i = 0; i<n; i++){
        	siguiente = Integer.parseInt(b[i]);
        	if(!sacados.contains(siguiente)) {
        		librosSacados = sacar(siguiente, libros, sacados);
        		if(cont>0)
        			out.print(" "+librosSacados);
        		else
        			out.print(librosSacados);
        	}
        	else {
        		if(cont>0)
        			out.print(" "+0);
        		else
        			out.print(0);
        	}
        	cont++;
        }
        /*LinkedList<Integer> a = new LinkedList<>(Arrays.asList(4,3,6,7));
        out.println(existeLibro(7,a));
        out.println(sacar(3,a));
        out.print(sacar(6,a));*/
        
        out.flush();
	}
    public static int sacar(int siguiente, LinkedList<Integer> libros,HashSet<Integer> sacados) {
    	int tot = 0;
    	boolean encontrado = false;
    	while(!encontrado) {
    		//System.out.println(libros.peek());
    		if(libros.peek() == siguiente) {
    			sacados.add(libros.pop());
    			tot++;
    			encontrado = true;
    		}
    		else {
    			sacados.add(libros.pop());
    			tot++;
    		}
    	}
    	return tot;
    }
   /* public static boolean esDiverse(String s, int l) {
    	int cont;
    	for(int i = 0; i<l; i++) {
    		cont = 0;
    		for(int j = 0; j<l; j++) {
    			if(s.charAt(i) == s.charAt(j) ) {
    				cont++;
    			}
    			if(cont>l/2) {
    				return false;
    			}
    		}
    	}
    	
    	return true;
    }*/
}