#include <bits/stdc++.h>
using namespace std;
struct inter {
  long long int s, e;
};
int main() {
  long long n;
  cin >> n;
  long long V[n], T[n], Rsum[n], Lsum[n];
  for (long long int i = 0; i < n; ++i) cin >> V[i];
  long long sum = 0;
  for (long long int i = 0; i < n; ++i) {
    cin >> T[i];
    sum += T[i];
    Lsum[i] = sum;
  }
  sum = 0;
  for (long long int i = n - 1; i >= 0; --i) {
    sum += T[i];
    Rsum[i] = sum;
  }
  vector<inter> AN;
  long long answer[n];
  vector<long long> LsumA(Lsum, Lsum + n);
  long long int interval[n];
  for (int i = 0; i < n; ++i) {
    answer[i] = 0;
    interval[i] = 0;
  }
  for (int i = 0; i < n; i++) {
    struct inter p;
    if (V[i] >= Rsum[i]) {
      p.s = i;
      p.e = n;
      AN.push_back(p);
    } else {
      if (V[i] <= T[i]) {
        answer[i] += V[i];
      } else {
        p.s = i;
        p.e = i;
        long long tf = Lsum[i] - T[i] + V[i];
        long long ind =
            upper_bound(LsumA.begin(), LsumA.end(), tf) - LsumA.begin();
        if (ind >= n) {
          p.e = n;
        } else if (Lsum[ind - 1] == tf) {
          p.e = ind - 1;
        } else {
          p.e = max(ind - 1, p.e);
          answer[ind] += V[i] - (Lsum[ind - 1] - Lsum[i] + T[i]);
        }
        AN.push_back(p);
      }
    }
  }
  for (int i = 0; i < AN.size(); ++i) {
    if (AN[i].s < n) {
      interval[AN[i].s]++;
      if (AN[i].e + 1 < n) interval[AN[i].e + 1]--;
    }
  }
  for (int i = 0; i < n; ++i) {
    if (i) interval[i] += interval[i - 1];
    answer[i] += interval[i] * T[i];
    cout << answer[i] << " ";
  }
  return 0;
}
