#include <bits/stdc++.h>

using namespace std;

// #define LOCK_GETCHAR
// #define USE_INT_128

#if __cplusplus < 201400
#warning "Please use c++14 or higher."
#define CONSTEXPR_FUNC
#define ENABLE_IF_INT
#else
#define CONSTEXPR_FUNC constexpr
#define ENABLE_IF_INT , enable_if_t<_is_integer<T>, int> = 0
template <class T> constexpr bool _is_integer = numeric_limits<T>::is_integer;
template <> constexpr bool _is_integer<bool> = false;
template <> constexpr bool _is_integer<char> = false;
#ifdef USE_INT_128
template <> constexpr bool _is_integer<__int128> = true;
template <> constexpr bool _is_integer<__uint128_t> = true;
#endif
#endif

#if !defined(_WIN32) && !defined(LOCK_GETCHAR)
#define getchar getchar_unlocked
#endif

#define il inline
#define mkp make_pair
#define fi first
#define se second
#define _loop_i_t(j, k) make_signed_t<decltype((j) - (k))>
#define For(i, j, k) for (_loop_i_t(j, k) i = (j); i <= (k); ++i) // NOLINT
#define ForDown(i, j, k)                                                       \
  for (_loop_i_t(j, k) i = (j); i >= decltype(i)(k); --i) // NOLINT
#define eb emplace_back
#ifndef ONLINE_JUDGE
#define FileIO(filename)                                                       \
  freopen(filename ".in", "r", stdin);                                         \
  freopen(filename ".out", "w", stdout)
#else
#define FileIO(filename) void(0)
#endif

using ll = long long;
using uint = unsigned int;
using ull = unsigned long long;
using db = double;
using ldb = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#ifdef USE_INT_128
using lll = __int128_t;
using ulll = __uint128_t;
#endif

// clang-format off
CONSTEXPR_FUNC il ll qpow(ll x, ull y, ll mod){ ll ans = 1; x %= mod; while (y) { if (y & 1) (ans *= x) %= mod; (x *= x) %= mod; y >>= 1; } return ans; }
template<typename T> CONSTEXPR_FUNC il void cmin(T & x, const T &y){ x = min(x, y); }
template<typename T> CONSTEXPR_FUNC il void cmax(T & x, const T &y){ x = max(x, y); }
template<typename T ENABLE_IF_INT> il void read(T &x){ x = 0; int f = 1; int c = getchar(); while (!isdigit(c)) { if (c == '-') f = -1; c = getchar(); } while (isdigit(c)) { x = x * 10 + c - '0'; c = getchar(); } x *= f; }
template<typename T, typename ... Args> il void read(T &x, Args &... y){ read(x), read(y...); }
// clang-format on

// File head end

namespace {
constexpr ll MAXN = 2e5 + 5, INF = ll(1e18) + 5;
struct Node {
  int l, r;
  pair<ll, int> maxv, minv;
  ll tag;
  Node() : l(0), r(0), maxv{}, minv{}, tag(0) {}
} T[MAXN << 2];
vector<int> todo[MAXN];
#define lc(p) ((p) << 1)
#define rc(p) ((p) << 1 | 1)
il void pu(int p) {
  T[p].maxv = max(T[lc(p)].maxv, T[rc(p)].maxv);
  T[p].minv = min(T[lc(p)].minv, T[rc(p)].minv);
}
void build(int p, int l, int r) {
  T[p].l = l, T[p].r = r;
  if (l == r)
    return T[p].maxv.se = T[p].minv.se = l, void();
  int mid = (l + r) >> 1;
  build(lc(p), l, mid), build(rc(p), mid + 1, r);
  pu(p);
}
il void f(int p, ll v) { T[p].maxv.fi += v, T[p].minv.fi += v, T[p].tag += v; }
void pd(int p) {
  if (T[p].tag)
    f(lc(p), T[p].tag), f(rc(p), T[p].tag), T[p].tag = 0;
}
void add(int p, int ql, ll val) {
  int l = T[p].l, r = T[p].r;
  if (ql <= l)
    return f(p, val);
  int mid = (l + r) >> 1;
  pd(p);
  if (ql <= mid)
    add(lc(p), ql, val);
  add(rc(p), ql, val);
  pu(p);
}
tuple<int, int, bool> qry(int p, int v, pair<ll, int> minv,
                          pair<ll, int> maxv) { // 1->maxv 0->minv
  int l = T[p].l, r = T[p].r;
  if (l == r) {
    cmax(maxv, T[p].maxv), cmin(minv, T[p].minv);
    assert(maxv.fi - minv.fi > v);
    return T[p].maxv == maxv ? make_tuple(l, minv.se, 1)
                             : make_tuple(l, maxv.se, 0);
  }
  pd(p);
  auto mn = min(minv, T[rc(p)].minv), mx = max(maxv, T[rc(p)].maxv);
  if (mx.fi - mn.fi > v)
    return qry(rc(p), v, minv, maxv);
  else
    return qry(lc(p), v, mn, mx);
}
ll at(int p, int pos) {
  while (T[p].l != T[p].r) {
    pd(p);
    int mid = (T[p].l + T[p].r) >> 1;
    p = p << 1 | (pos > mid);
  }
  return T[p].maxv.fi;
}
} // namespace

std::vector<int> distribute_candies(std::vector<int> c, std::vector<int> l,
                                    std::vector<int> r, std::vector<int> v) {
  int n = c.size(), q = l.size();
  vector<int> Ans(n);
  build(1, 0, q);
  For(i, 1, q) {
    todo[l[i - 1] + 1].eb(i);
    todo[r[i - 1] + 2].eb(-i);
  }
  ll sum = 0;
  For(i, 1, n) {
    for (int j : todo[i]) {
      if (j > 0)
        add(1, j, v[j - 1]), sum += v[j - 1];
      else
        add(1, -j, -v[-j - 1]), sum -= v[-j - 1];
    }
    // cerr << i << ' ' << sum << ' ' << T[1].maxv.fi << ' ' << T[1].minv.fi
    //      << '\n';
    if (T[1].maxv.fi - T[1].minv.fi <= c[i - 1]) {
      Ans[i - 1] = sum - T[1].minv.fi;
      continue;
    }
    auto [id1, id2, tp] = qry(1, c[i - 1], {INF, 0}, {0, 0});
    if (tp)
      Ans[i - 1] = sum - at(1, id2);
    else
      Ans[i - 1] = sum + c[i - 1] - at(1, id2);
  }
  return Ans;
}