#include<bits/stdc++.h>
#define int long long
#define db long double
using namespace std;
const int N=5e5+10;
int a[N],b[N],c[N],f[N],s[N],ss[N];
array<int,3> w[N];
void solve(){
    int n;cin>>n;
    for(int i=1;i<=n;i++) cin>>a[i];
    for(int i=1;i<=n;i++) cin>>c[i];
    for(int i=1;i<=n;i++) cin>>b[i];
    for(int i=1;i<=n;i++){
        //转移
        if(a[i]==0){
        f[i]=min(b[i]+1,c[i])-1;
        f[i]=max(f[i],0ll);
        ss[i]=ss[i-1]+f[i];
        s[i]=s[i-1];
        }
        else{
        if(c[i]<=a[i])f[i]=c[i];
        else{
            int mid=c[i]-a[i];
            mid=min(mid,b[i]);
            f[i]=a[i]+mid;
        }
        ss[i]=ss[i-1];
        s[i]=f[i]+s[i-1];
        }
        
    }
    for(int i=1;i<=n;i++){
        if(a[i]){
        int res=a[i]+b[i]+s[n]-f[i];
        if(ss[n]&&s[n]){
            res+=ss[n];
        }
        cout<<res<<" ";
        }
        else{
            int res=b[i]+s[n];
            if(s[n]&&ss[n]) res+=ss[n]-f[i];
            if(!s[n]) res=0;
            cout<<res<<" ";
        }
        
    }
    int ans=0,cnt=0;
    cout<<"\n";
    for(int i=1;i<=n;i++){
        w[i]={c[i],b[i],a[i]};
        if(a[i])
        ans+=a[i]+b[i],cnt+=c[i];
    }
    sort(w+1,w+n+1);
    for(int i=n;i>=1;i--){
        auto [cc,aa,bb]=w[i];
        if(!aa){
            if(cnt) ans+=bb,cnt+=cc;
        }
    }
    cout<<ans;
}

signed main(){
ios::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
//    int T;cin>>T;
//    while(T--)
    solve();
}