Producing Snow

Alice likes snow a lot! Unfortunately, this year's winter is already over, and she can't expect to have any more of it. Bob has thus bought her a gift — a large snow maker. He plans to make some amount of snow every day. On day i he will make a pile of snow of volume V_i and put it in her garden.

Each day, every pile will shrink a little due to melting. More precisely, when the temperature on a given day is T_i, each pile will reduce its volume by T_i. If this would reduce the volume of a pile to or below zero, it disappears forever. All snow piles are independent of each other.

Note that the pile made on day i already loses part of its volume on the same day. In an extreme case, this may mean that there are no piles left at the end of a particular day.

You are given the initial pile sizes and the temperature on each day. Determine the total volume of snow melted on each day.

Input

The first line contains a single integer N (1 ≤ N ≤ 10⁵) — the number of days.

The second line contains N integers V₁, V₂, ..., V_N (0 ≤ V_i ≤ 10⁹), where V_i is the initial size of a snow pile made on the day i.

The third line contains N integers T₁, T₂, ..., T_N (0 ≤ T_i ≤ 10⁹), where T_i is the temperature on the day i.

Output

Output a single line with N integers, where the i-th integer represents the total volume of snow melted on day i.

Example

Input

3
10 10 5
5 7 2

Output

5 12 4

Input

5
30 25 20 15 10
9 10 12 4 13

Output

9 20 35 11 25

题意：第i天有V[i]体积的雪，每天会消融t[i]体积的雪，求每天消融的雪的体积。

解题思路:本题直接做出来是n方复杂度，这个是会超限的。所以我们每天求出消融体积的时候尽量不能往回搜。给个优先级队列。第i天就把v[i]+sum[i-1]存起来。然后融化量ans=t[i]*q.size()。这个结果的目的是第i天回消融t[i]体积的雪，之前的也会消融t[i]体积的雪，所以用这个来表示ans。然后当雪已经没了的时候，也就是我第i天的时候，第一天的雪已经没了，这时候就优先队列会size-1，如果第一天的雪还在，但是不够你消融的，这就会超出雪融体积，这时候就ans+=q.top()-sum[i]；因为这超出部分就是当前所有消融体积-那天不够消融的。所以代码是

#include<iostream>
#include<cstdio>
#include<queue>
#include<cstring>
#include<functional>
#include<algorithm>
 using namespace std;
  typedef long long LL;
  const int N=1e5+5;


 LL t[N],sum[N],v[N];                           


 int main(){
     priority_queue<LL,vector<LL>,greater<LL> >q;
    int n,m;
     scanf("%d",&n);     for(int i=1;i<=n;i++){
        scanf("%lld",&v[i]);


     }
     for(int i=1;i<=n;i++){
       scanf("%lld",&t[i]);
        sum[i]=t[i]+sum[i-1];
     }
     for(int i=1;i<=n;i++){
         q.push(v[i]+sum[i-1]);                  
         LL ans=t[i]*q.size();                   
         while(!q.empty()&&q.top()<=sum[i]){     
         ans+=q.top()-sum[i];
             q.pop();
        }
         printf("%lld%c",ans,i==n?'\n':' ');
     }
    return 0;
 }