//#define NDEBUG
#pragma warning(disable : 4146)

#include <algorithm>
#include <cassert>
#include <cstddef>
#include <cstdint>
#include <iomanip>
#include <iostream>
#include <utility>
#include <vector>

namespace n91 {

using i32 = std::int32_t;
using i64 = std::int64_t;
using u32 = std::uint32_t;
using u64 = std::uint64_t;
using isize = std::ptrdiff_t;
using usize = std::size_t;
using f64 = double;

struct rep {
  struct itr {
    usize i;
    constexpr itr(const usize i) noexcept : i(i) {}
    void operator++() noexcept { ++i; }
    constexpr usize operator*() const noexcept { return i; }
    constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
  };
  const itr f, l;
  constexpr rep(const usize f, const usize l) noexcept
      : f(std::min(f, l)), l(l) {}
  constexpr auto begin() const noexcept { return f; }
  constexpr auto end() const noexcept { return l; }
};
struct revrep {
  struct itr {
    usize i;
    constexpr itr(const usize i) noexcept : i(i) {}
    void operator++() noexcept { --i; }
    constexpr usize operator*() const noexcept { return i; }
    constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
  };
  const itr f, l;
  constexpr revrep(const usize f, const usize l) noexcept
      : f(l - 1), l(std::min(f, l) - 1) {}
  constexpr auto begin() const noexcept { return f; }
  constexpr auto end() const noexcept { return l; }
};
template <class T> auto md_vec(const usize n, const T &value) {
  return std::vector<T>(n, value);
}
template <class... Args> auto md_vec(const usize n, Args... args) {
  return std::vector<decltype(md_vec(args...))>(n, md_vec(args...));
}
template <class T> constexpr T difference(const T &a, const T &b) noexcept {
  return a < b ? b - a : a - b;
}
template <class T> void chmin(T &a, const T &b) noexcept {
  if (b < a)
    a = b;
}
template <class T> void chmax(T &a, const T &b) noexcept {
  if (a < b)
    a = b;
}
template <class F> class rec_lambda {
  F f;

public:
  rec_lambda(F &&f_) : f(std::forward<F>(f_)) {}
  template <class... Args> auto operator()(Args &&... args) const {
    return f(*this, std::forward<Args>(args)...);
  }
};
template <class T> T scan() {
  T ret;
  std::cin >> ret;
  return ret;
}
constexpr char eoln = '\n';

i64 floor_div(const i64 n, const i64 d) {
  assert(d != 0);
  return n / d - static_cast<i64>((n ^ d) < 0 && n % d != 0);
}

i64 ceil_div(const i64 n, const i64 d) {
  assert(d != 0);
  return n / d + static_cast<i64>((n ^ d) >= 0 && n % d != 0);
}

#ifdef N91_LOCAL
#define OJ_LOCAL(a, b) b
#else
#define OJ_LOCAL(a, b) a
#endif

} // namespace n91

#include <cassert>
#include <cstdint>

namespace binary_search_impl {

using i64 = std::int64_t;

template <class F> i64 binary_search(F f, i64 left, i64 right) {
  assert(left <= right);

  while (left != right) {
    const i64 mid = left + (right - left) / 2;
    if (f(mid)) {
      left = mid + 1;
    } else {
      right = mid;
    }
  }
  return left;
}

} // namespace binary_search_impl

// first false
using binary_search_impl::binary_search;

#include <atcoder/dsu>
#include <atcoder/segtree>

namespace n91 {

std::vector<usize> inverse(const std::vector<usize> &p) {
  const usize n = p.size();
  std::vector<usize> q(n, -1);
  for (usize i = 0; i != n; i += 1) {
    assert(p[i] < n);
    assert(q[p[i]] == -1);
    q[p[i]] = i;
  }
  return q;
}

usize op(usize x, usize y) { return std::max(x, y); }

usize id() { return 0; }

void main_() {
  const usize n = scan<usize>();

  std::vector<usize> a(n), b(n), z(n);
  for (const usize i : rep(0, n)) {
    std::cin >> a[i];
    a[i] -= 1;
  }
  for (const usize i : rep(0, n)) {
    std::cin >> b[i];
    b[i] -= 1;
  }
  for (const usize i : rep(0, n)) {
    std::cin >> z[i];
    z[i] -= 1;
  }

  const auto ra = inverse(a), rb = inverse(b), rz = inverse(z);

  atcoder::segtree<usize, op, id> sega(a), segb(b);
  const auto get_left = [&](auto &seg, const usize i, const usize t) -> usize {
    if (seg.get(i) > t) {
      return i;
    } else {
      return seg.min_left(i, [&](const usize x) { return x <= t; });
    }
  };
  const auto get_right = [&](auto &seg, const usize i, const usize t) -> usize {
    if (seg.get(i) > t) {
      return i + 1;
    } else {
      return seg.max_right(i + 1, [&](const usize x) { return x <= t; });
    }
  };

  std::vector<std::vector<usize>> raft(n);
  {
    for (const usize i : rep(0, n)) {
      raft[binary_search(
               [&](const usize t) {
                 const usize l = std::max(get_left(sega, ra[i], t),
                                          get_left(segb, rb[z[i]], t));
                 const usize r = std::min(get_right(sega, ra[i], t),
                                          get_right(segb, rb[z[i]], t));
                 return !(l < r);
               },
               0, n - 1)]
          .push_back(i);
    }
  }

  usize ans = 0;

  std::vector<usize> count(n + 1, 4);
  std::vector<std::pair<usize, usize>> data(n, {1, 0});
  atcoder::dsu uf(n);

  const auto cost = [&](const usize i) {
    return std::min(data[i].first, data[i].second);
  };

  const auto dec = [&](const usize i) {
    count[i] -= 1;
    if (count[i] != 0) {
      return;
    }
    usize x = i - 1;
    usize y = i;
    x = uf.leader(x);
    y = uf.leader(y);
    ans -= cost(x);
    ans -= cost(y);
    uf.merge(x, y);
    if (uf.leader(x) != x) {
      std::swap(x, y);
    }
    data[x].first += data[y].first;
    data[x].second += data[y].second;
    ans += cost(x);
  };

  for (const usize t : rep(0, n)) {
    dec(ra[t]);
    dec(ra[t] + 1);
    dec(rb[t]);
    dec(rb[t] + 1);
    for (const usize i : raft[t]) {
      usize l = std::max(get_left(sega, ra[i], t), get_left(segb, rb[z[i]], t));
      l = uf.leader(l);
      ans -= cost(l);
      data[l].second += 1;
      ans += cost(l);
    }
    std::cout << ans << eoln;
  }
}

} // namespace n91

int main() {
  //*
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  //*/
  std::cout << std::setprecision(20);
  n91::main_();
  return 0;
}