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.IOException;
    import java.io.InputStream;
    import java.io.PrintWriter;
    import java.io.*;
    import java.util.*;
    import java.util.LinkedList;
    import java.math.*;
    import java.lang.*;
    import java.util.PriorityQueue;
    import static java.lang.Math.*;
    @SuppressWarnings("unchecked")
    public class Solution implements Runnable {
        static class InputReader {
            private InputStream stream;
            private byte[] buf = new byte[1024];
            private int curChar;
            private int numChars;
            private SpaceCharFilter filter;
            private BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

            public InputReader(InputStream stream) {
                this.stream = stream;
            }

            public int read() {
                if (numChars==-1)
                    throw new InputMismatchException();

                if (curChar >= numChars) {
                    curChar = 0;
                    try {
                        numChars = stream.read(buf);
                    }
                    catch (IOException e) {
                        throw new InputMismatchException();
                    }

                    if(numChars <= 0)
                        return -1;
                }
                return buf[curChar++];
            }

            public String nextLine() {
                String str = "";
                try {
                    str = br.readLine();
                }
                catch (IOException e) {
                    e.printStackTrace();
                }
                return str;
            }
            public int nextInt() {
                int c = read();

                while(isSpaceChar(c))
                    c = read();

                int sgn = 1;

                if (c == '-') {
                    sgn = -1;
                    c = read();
                }

                int res = 0;
                do {
                    if(c<'0'||c>'9')
                        throw new InputMismatchException();
                    res *= 10;
                    res += c - '0';
                    c = read();
                }
                while (!isSpaceChar(c));

                return res * sgn;
            }

            public long nextLong() {
                int c = read();
                while (isSpaceChar(c))
                    c = read();
                int sgn = 1;
                if (c == '-') {
                    sgn = -1;
                    c = read();
                }
                long res = 0;

                do {
                    if (c < '0' || c > '9')
                        throw new InputMismatchException();
                    res *= 10;
                    res += c - '0';
                    c = read();
                }
                while (!isSpaceChar(c));
                    return res * sgn;
            }

            public double nextDouble() {
                int c = read();
                while (isSpaceChar(c))
                    c = read();
                int sgn = 1;
                if (c == '-') {
                    sgn = -1;
                    c = read();
                }
                double res = 0;
                while (!isSpaceChar(c) && c != '.') {
                    if (c == 'e' || c == 'E')
                        return res * Math.pow(10, nextInt());
                    if (c < '0' || c > '9')
                        throw new InputMismatchException();
                    res *= 10;
                    res += c - '0';
                    c = read();
                }
                if (c == '.') {
                    c = read();
                    double m = 1;
                    while (!isSpaceChar(c)) {
                        if (c == 'e' || c == 'E')
                            return res * Math.pow(10, nextInt());
                        if (c < '0' || c > '9')
                            throw new InputMismatchException();
                        m /= 10;
                        res += (c - '0') * m;
                        c = read();
                    }
                }
                return res * sgn;
            }

            public String readString() {
                int c = read();
                while (isSpaceChar(c))
                    c = read();
                StringBuilder res = new StringBuilder();
                do {
                    res.appendCodePoint(c);
                    c = read();
                }
                while (!isSpaceChar(c));

                return res.toString();
            }

            public boolean isSpaceChar(int c) {
                if (filter != null)
                    return filter.isSpaceChar(c);
                return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
            }

            public String next() {
                return readString();
            }

            public interface SpaceCharFilter {
                public boolean isSpaceChar(int ch);
            }
        }
        public static long min(long a,long b)
        {
            if(a>b)
            {
                return b;
            }
            return a;
        }
        public static int min(int a,int b)
        {
            if(a>b)
            {
                return b;
            }
            return a;
        }
        public static long max(long a,long b)
        {
            if(a>b)
            {
                return a;
            }
            return b;
        }
        public static int max(int a,int b)
        {
            if(a>b)
            {
                return a;
            }
            return b;
        }
        static class pair implements Comparable<pair>
        {
          int x;
          int y;
          pair(int x,int y)
          {
            this.x = x;
            this.y = y;
          }
          public int compareTo(pair b)
          {
            if(this.x>b.x)
            {
              return 1;
            }
            else if(this.x<b.x)
            {
              return -1;
            }
            else
            {
              return this.y-b.y;
            }
          }
        }
        public static int gcd(int a,int b)
        {
            if(a==0)
            return b;
            if(b==0)
            return a;
            while((a%=b)!=0&&(b%=a)!=0);
            return a^b;
        }
        public static int mod(int a)
        {
          if(a>0)
            return a;
          return -a;
        }
        static int mod = (int)1e9+7;;
        public static long expo(long exp,long pow)
        {
          long ans = 1;
          while(pow!=0)
          {
            if((pow&1)==1)
            {
              ans = ans*exp;
            }
            exp = exp*exp;
            pow = pow>>1;
          }
          return ans;
        }
        static int max = (int)1e6;
        public static long fact(int num)
        {
            if(num==0)
            {
              return 1;
            }
            return (fact(num-1)*num)%mod;
        }
        static int[] sieve;
        public static void sieve()
        {
          sieve = new int[max+1];
          for(int i=1;i<=max;i++)
          {
            sieve[i] = i;
          }
          for(int i=2;i<max;i++)
          {
            if(sieve[i]==i)
            {
              for(int j=i*2;j<=max;j+=i)
              {
                if(sieve[j]==j)
                {
                  sieve[j] = i;
                }
              }
            }
          }
        }
        public static int bsearch(long[] a,long val)
        {
          int l = 0;
          int r = a.length-1;
          while(l<r)
          {
            int mid = (l+r+1)>>1;
            if(a[mid]<=val)
            {
              l = mid;
            }
            else
            {
               r = mid-1;
            }
          }
          if(a[l]<=val)
          {
            return l+1;
          }
          return 0;
        }
        public static int random(int min,int max)
        {
          return (int)((max-min)*Math.random());
        }
        static int[] bit;
        static int n;
        public static void update(int idx)
        {
          while(idx<=n)
          {
            bit[idx]+=1;
            idx+=idx&(-idx);
          }
        }
        public static int query(int idx)
        {
          int sum = 0;
          while(idx>0)
          {
            sum+=bit[idx];
            idx-=idx&(-idx);
          }
          return sum;
        }
        public static void main(String args[]) throws Exception {
            new Thread(null, new Solution(),"Main",1<<26).start();
        }
        public void run() {
          InputReader sc  = new InputReader(System.in);
          PrintWriter out = new PrintWriter(System.out);
          int t1 = 1;
          while(t1-->0)
          {
            int n = sc.nextInt();
            int[] a = new int[n];
            int[] b = new int[n];
            int[] ind = new int[n+1];
            for(int i=0;i<n;i++)
            {
              a[i] = sc.nextInt();
              ind[a[i]] = i;
            }
            int[] ans = new int[n];
            int max = -1;
            for(int i=0;i<n;i++)
            {
              int x = sc.nextInt();
              if(ind[x]<=max)
              {
                ans[i] = 0;
              }
              else
              {
                ans[i] = ind[x]-max;
                max = ind[x];
              }
            }
            for(int i=0;i<n;i++)
            {
              out.print(ans[i]+" ");
            }
            out.println();
          }
          out.close();
         }
    }
