#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include<ext/pb_ds/hash_policy.hpp>
#include<ext/pb_ds/trie_policy.hpp>
#include<ext/pb_ds/priority_queue.hpp>
#define int long long
char freadgetchar(){
    static char buf[100000],*p1=buf,*p2=buf;
    if(p1==p2){
        p2=(p1=buf)+fread(buf,1,100000,stdin);
        if (p1==p2)return EOF;
    }
    return *p1++;
}
void read(int&x){
    static char c;
    c=freadgetchar();
    int b=1;
    for(x=0;!(c>='0'&&c<='9');c=freadgetchar()) if(c=='-') b=-b;
    for(;c>='0'&&c<='9';x=x*10+c-'0',c=freadgetchar());x*=b;
}
const int MAXN=4e6+5;
int a[MAXN],b[MAXN],c[MAXN];
int maxa[MAXN],maxb[MAXN];
int suma=0,sumb;
int n;
signed main(){
    std::cin>>n;
    for(int i=1;i<=n;i++){
        std::cin>>a[i];
    }
    for(int i=1;i<=n;i++)std::cin>>b[i];
    for(int i=1;i<=n;i++)std::cin>>c[i];
    for(int i=1;i<=n;i++){
        if(a[i]!=0)maxa[i]=a[i]+c[i];
        maxb[i]=std::min(maxa[i],b[i]);
        suma+=maxa[i];
        sumb+=maxb[i];
    }
    for(int i=1;i<=n;i++){
        std::cout<<maxa[i]+sumb-maxb[i]<<' ';
    }
    std::cout<<'\n'<<suma;
    return 0;
}