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.Scanner;

import java.util.*;
import static java.lang.Math.*; 
import static java.util.Arrays.*;

import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.IOException;

import static java.lang.Character.*;
import static java.lang.Double.*;

public class B {
	
	private FastReadere scan=new FastReadere();
	
	void solve() {
		int n = scan.nextInt();
		int[]A = new int[n];
		HashSet<Integer>has = new HashSet<>();
		for(int i=0;i<n;i++) {
			A[i]=scan.nextInt();
			has.add(A[i]);
		}
		int top=0;
		StringBuffer res = new StringBuffer();
		for(int t=0;t<n;t++) {
			int b = scan.nextInt();
			if(!has.contains(b)) {
				res.append("0 ");
				continue;
			}
			int r=0;
			while(true) {
				has.remove(A[top]);
				top++;
				r++;
				if(A[top-1]==b)break;
			}
			res.append(r); res.append(" ");
		}
		System.out.println(res);
	}
	
	public static void main(String[] args) {
		B me = new B();
		try{
			Class.forName("SlexTemplate");
			String sample = me.getClass().getName()+".in";
			me.scan = new FastReadere((sample));
		}catch (Exception e) {
		}
		me.solve();
	}
}


class FastReadere {

    	final private int BUFFER_SIZE = 1 << 20;
    	private DataInputStream din;
    	private byte[] buffer;
    	private int bufferPointer, bytesRead;

    	public FastReadere() {
    		din = new DataInputStream(System.in);
    		buffer = new byte[BUFFER_SIZE];
    		bufferPointer = bytesRead = 0;
    	}

    	public FastReadere(String file_name) {
    		try {
    			din = new DataInputStream(new FileInputStream(file_name));
    			buffer = new byte[BUFFER_SIZE];
    			bufferPointer = bytesRead = 0;
    		} catch (IOException e) {
    			throw new RuntimeException(e);
    		}
    	}

    	public String readLine() {
    		StringBuffer sb = new StringBuffer();
    		int c;
    		while ((c = read()) != -1) {
    			if (c == '\n')
    				break;
    			if(c=='\r') {
    				read();
    				break;
    			}
    			sb.append( (char) c);
    		}
    		return sb.toString();
    	}
    	
    	public String next() {
    		StringBuffer sb = new StringBuffer();
    		int  c;
    		while ((c = read()) != -1) {
    			if (Character.isWhitespace(c))
    				break;
    			sb.append( (char) c);
    		}
    		return sb.toString();
    	}

    	public int nextInt() {
    		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() {
    		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() {
    		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(c=='E' || c=='e') {
    			int exp = nextInt();
    			ret = ret * Math.pow(10,exp);
    		}
    		if (neg)
    			return -ret;
    		return ret;
    	}

    	private void fillBuffer() {
    		try {
    			bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);
    		} catch (IOException e) {
    			throw new RuntimeException(e);
    		}
    		if (bytesRead == -1)
    			buffer[0] = -1;
    	}

    	private byte read() {
    		if (bufferPointer == bytesRead)
    			fillBuffer();
    		return buffer[bufferPointer++];
    	}
    }