#include<bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define pb push_back
#define int long long
typedef long long ll;
typedef pair<int,int> PII;
const int N=4e5,M=320,mod=1e18;

int T;
int n,cnt;
struct ball{
	int a,b,c,d;
	bool operator < (const ball k) const
	{
		return b>k.b;
	}
}e[N],f[N];
int s[N];

void solve()
{
	cin>>n;
	for(int i=1;i<=n;i++) cin>>e[i].a;
	for(int i=1;i<=n;i++) cin>>e[i].b;
	for(int i=1;i<=n;i++)
	{
		cin>>e[i].c;
		e[i].d=min(e[i].a+e[i].c,e[i].b);
		s[i]=s[i-1]+e[i].d;
	}
	int ans=0;
	for(int i=1;i<=n;i++)
	{
		int m=s[n]-e[i].d+e[i].a+e[i].c;
		if(i!=n) cout<<m<<' '; 
		else cout<<m<<endl;
		if(e[i].a+e[i].c<=e[i].b) ans+=e[i].d;
		else ans+=e[i].a+e[i].c;
	}
	
//	sort(f,f+cnt);
//	for(int i=0;i<cnt-1;i++) ans+=f[i].b;
//	ans+=f[cnt-1].a+f[cnt-1].c;
	cout<<ans;
}

signed main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0); 
	T=1;
	while(T--)
	{
		solve();
	}
	return 0;
}