#include <bits/stdc++.h>
using namespace std;
const int N = 100000 + 10;
long long int v[N], T[N], sum[N], mul[N], add[N], ans[N];
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &v[i]);
  }
  sum[0] = 0;
  for (int i = 1; i <= n; i++) {
    scanf("%d", &T[i]);
    sum[i] = sum[i - 1] + T[i];
  }
  sum[n + 1] = 0x7fffffffffff + sum[n];
  for (int i = 1; i <= n; i++) {
    int mid = upper_bound(i + sum, sum + n + 2, sum[i - 1] + v[i]) - sum - 1;
    mul[i] += 1;
    mul[mid + 1] -= 1;
    add[mid + 1] += v[i] - (sum[mid] - sum[i - 1]);
  }
  for (int i = 1; i <= n; i++) mul[i] = mul[i] + mul[i - 1];
  for (int i = 1; i <= n; i++) ans[i] = T[i] * mul[i] + add[i];
  for (int i = 1; i <= n; i++) {
    printf("%lld ", ans[i]);
  }
  printf("\n");
  return 0;
}
