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.text.NumberFormat;
        import java.util.*;
        import java.io.*;
        import java.util.Collections;
         
        /**
         * @author Priyanshu
         *
         */
         
         
         
         
        public class Main {
         
        	/**
        	 * @param args
        	 */
        	 
        static class Reader 
    { 
        final private int BUFFER_SIZE = 1 << 16; 
        private DataInputStream din; 
        private byte[] buffer; 
        private int bufferPointer, bytesRead; 
  
        public Reader() 
        { 
            din = new DataInputStream(System.in); 
            buffer = new byte[BUFFER_SIZE]; 
            bufferPointer = bytesRead = 0; 
        } 
  
        public Reader(String file_name) throws IOException 
        { 
            din = new DataInputStream(new FileInputStream(file_name)); 
            buffer = new byte[BUFFER_SIZE]; 
            bufferPointer = bytesRead = 0; 
        } 
  
        public String readLine() throws IOException 
        { 
            byte[] buf = new byte[64]; // line length 
            int cnt = 0, c; 
            while ((c = read()) != -1) 
            { 
                if (c == '\n') 
                    break; 
                buf[cnt++] = (byte) c; 
            } 
            return new String(buf, 0, cnt); 
        } 
  
        public int nextInt() throws IOException 
        { 
            int ret = 0; 
            byte c = read(); 
            while (c <= ' ') 
                c = read(); 
            boolean neg = (c == '-'); 
            if (neg) 
                c = read(); 
            do
            { 
                ret = ret * 10 + c - '0'; 
            }  while ((c = read()) >= '0' && c <= '9'); 
  
            if (neg) 
                return -ret; 
            return ret; 
        } 
  
        public long nextLong() throws IOException 
        { 
            long ret = 0; 
            byte c = read(); 
            while (c <= ' ') 
                c = read(); 
            boolean neg = (c == '-'); 
            if (neg) 
                c = read(); 
            do { 
                ret = ret * 10 + c - '0'; 
            } 
            while ((c = read()) >= '0' && c <= '9'); 
            if (neg) 
                return -ret; 
            return ret; 
        } 
  
        public double nextDouble() throws IOException 
        { 
            double ret = 0, div = 1; 
            byte c = read(); 
            while (c <= ' ') 
                c = read(); 
            boolean neg = (c == '-'); 
            if (neg) 
                c = read(); 
  
            do { 
                ret = ret * 10 + c - '0'; 
            } 
            while ((c = read()) >= '0' && c <= '9'); 
  
            if (c == '.') 
            { 
                while ((c = read()) >= '0' && c <= '9') 
                { 
                    ret += (c - '0') / (div *= 10); 
                } 
            } 
  
            if (neg) 
                return -ret; 
            return ret; 
        } 
  
        private void fillBuffer() throws IOException 
        { 
            bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE); 
            if (bytesRead == -1) 
                buffer[0] = -1; 
        } 
  
        private byte read() throws IOException 
        { 
            if (bufferPointer == bytesRead) 
                fillBuffer(); 
            return buffer[bufferPointer++]; 
        } 
  
        public void close() throws IOException 
        { 
            if (din == null) 
                return; 
            din.close(); 
        } 
    } 
    
    public static HashSet<Integer> ajlist[];
    public static ArrayList<Integer> coprime[];
    public static boolean[] visited;
    public static int count;
    public static boolean[] prime;
    
    public static int gcd(int a,int b){
        if(a==0){
            return b;
        }else{
            return gcd(b%a,a);
        }
    }
    
    static void DFSUtil(int v,int size)  { 
        visited[v] = true;
     //   System.out.print(v+" ");
        count++;
        for(int i = 0;i<size;i++){
            if(!ajlist[v].contains(i) && !visited[i]){
                DFSUtil(i,size);
            }
        }
    } 
    
    static void DFS(int v,int size) 
    { 
        visited = new boolean[size]; 
        DFSUtil(v,size); 
    } 
    
    static void sieveOfEratosthenes(int n){ 
        prime = new boolean[n+1];
          
        for(int p = 2; p*p <=n; p++) { 
            if(!prime[p]) 
            { 
                for(int i = p*2; i <= n; i += p) 
                    prime[i] = true; 
            } 
        } 
        // false values are prime numbers
    } 
    
     static void primeFactors(int n,int add) {
        while (n%2==0) 
        { 
            coprime[2].add(add);
            n /= 2; 
        } 
        for (int i = 3; i <= Math.sqrt(n); i+= 2) 
        { 
            while (n%i == 0) 
            { 
                coprime[i].add(add);
                n /= i; 
            } 
        } 
        if (n > 2){
            coprime[n].add(add);
        } 
          
    }
    
    static Set<Integer> findfactors(int n) {
        HashSet<Integer> factors = new HashSet<>();
        while (n%2==0) 
        { 
            factors.add(2);
            n /= 2; 
        } 
        for (int i = 3; i <= Math.sqrt(n); i+= 2) 
        { 
            while (n%i == 0) 
            { 
                factors.add(i);
                n /= i; 
            } 
        } 
        if (n > 2){
            factors.add(n);
        } 
        
        return factors;
          
    }

        
        	 
        	public static void main(String[] args)throws IOException{
        		 Reader sc =new Reader();
        		 int n = sc.nextInt();
        		 HashSet<Integer> hs = new HashSet<>();
        		 int[] con = new int[n];
        		 for(int i = 0;i<n;i++){
        		     int val = sc.nextInt();
        		     con[i] = val;
        		     hs.add(val);
        		 }
        		 int top=0;
        		 for(int i = 0;i<n;i++){
        		     int val = sc.nextInt();
        		     if(hs.contains(val)){
        		         int count = 0;
        		         while(con[top+count]!=val){
        		             hs.remove(con[top+count]);
        		             count++;
        		         }
        		         hs.remove(con[top+count]);
        		         count++;
        		         top +=count;
        		         System.out.print(count+" ");
        		     }else{
        		         System.out.print("0 ");
        		     }
        		 }
        		 System.out.println("");
        		 
        	}
        }  