CF1073B.Vasya and Books

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, \dots, b_n$ are distinct.

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

瓦西娅有 $n$ 本书，编号从 $1$ 到 $n$，堆叠成一摞。最上面的书编号为 $a_1$，其下方的书编号为 $a_2$，依此类推。位于栈底的书编号为 $a_n$。所有编号互不相同。

瓦西娅希望在 $n$ 步内将所有书全部放入他的背包中。在第 $i$ 步中，他希望将编号为 $b_i$ 的书放入背包。如果编号为 $b_i$ 的书仍在栈中，则他取出该书以及它上方的所有书，并将它们全部放入背包；否则他什么也不做，直接进入下一步。例如，若书的堆叠顺序为 $[1, 2, 3]$（书 $1$ 位于最上方），而瓦西娅按顺序 $[2, 1, 3]$ 取书，则：第一步他会取出两本书（$1$ 和 $2$）；第二步他什么也不做（因为书 $1$ 已在背包中）；第三步他取出一本书（编号为 $3$ 的书）。注意，$b_1, b_2, \dots, b_n$ 互不相同。

请帮助瓦西娅！告诉他每一步中他将放入背包的书本数量。

The first line contains one integer $n~(1 \le n \le 2 \cdot 10^5)$ — the number of books in the stack.

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

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

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

第一行包含一个整数 $n~(1 \le n \le 2 \cdot 10^5)$ —— 表示书堆中的书本数量。

第二行包含 $n$ 个整数 $a_1, a_2, \dots, a_n~(1 \le a_i \le n)$，表示书堆的初始排列。

第三行包含 $n$ 个整数 $b_1, b_2, \dots, b_n~(1 \le b_i \le n)$，表示瓦西亚将要执行的操作步骤。

所有数字 $a_1, \dots, a_n$ 互不相同，$b_1, \dots, b_n$ 同样互不相同。

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.

输出 $n$ 个整数。其中第 $i$ 个整数应等于 Vasya 在第 $i$ 步中放入他背包的书本数量。

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.

第一个示例已在题目描述中给出。

在第二个示例中，第一步中 Vasya 将移动书籍 $[3, 1, 4]$。之后，堆栈中仅剩下书籍 $2$ 和 $5$（其中 $2$ 位于 $5$ 的上方）。第二步中，Vasya 将取走书籍 $2$ 和 $5$。此后堆栈变为空，因此在后续步骤中 Vasya 将不再移动任何书籍。