#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
long long vol[N], res[N];
vector<long long> cost;
int mark[N];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int n;
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> vol[i];
  }
  int x;
  cost.push_back(0);
  for (int i = 1; i <= n; i++) {
    cin >> x;
    cost.push_back(x);
  }
  for (int i = 1; i <= n; i++) {
    cost[i] += cost[i - 1];
  }
  for (int i = 1; i <= n; i++) {
    if (vol[i] + cost[i - 1] >= cost[n]) {
      mark[i] += 1;
      continue;
    }
    int idx = lower_bound(cost.begin() + i, cost.end(), vol[i] + cost[i - 1]) -
              cost.begin();
    if (cost[idx] - cost[i - 1] - vol[i] == 0) {
      mark[idx + 1] += -1;
    } else {
      mark[idx] += -1;
      res[idx] += vol[i] - (cost[idx - 1] - cost[i - 1]);
    }
    mark[i] += 1;
  }
  for (int i = 1; i <= n; i++) {
    mark[i] += mark[i - 1];
    res[i] += (cost[i] - cost[i - 1]) * mark[i];
    cout << res[i] << " ";
  }
  return 0;
}
