#include <bits/stdc++.h>
#pragma warning(disable : 4786)
#pragma warning(disable : 4996)
template <class T>
inline T bigmod(T p, T e, T M) {
  long long ret = 1LL;
  for (; e > 0LL; e >>= 1LL) {
    if (e & 1LL) ret = (ret * p) % M;
    p = (p * p) % M;
  }
  return (T)ret;
}
template <class T>
inline T modinverse(T a, T M) {
  return bigmod(a, M - 2, M);
}
using namespace std;
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n;
  cin >> n;
  int a[n], b[n];
  bool bl[n];
  memset(bl, 0, sizeof bl);
  map<int, int> m;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    m[a[i]] = i + 1;
  }
  for (int i = 0; i < n; i++) {
    cin >> b[i];
  }
  int mx = 0;
  int count = 0;
  for (int i = 0; i < n; i++) {
    if (m[b[i]] > mx) {
      cout << m[b[i]] - mx << " ";
      mx = m[b[i]];
    } else {
      cout << 0 << " ";
    }
  }
}
