#include<bits/stdc++.h>
#define db double
#define LL long long
#define pb push_back
#define eb emplace_back
#define pli pair<LL,int>
#define pii pair<int,int>
#define fr first
#define sc second
#define mp make_pair
using namespace std;
const int dx[]={0,1,0,-1,1,1,-1,-1},
		  dy[]={1,0,-1,0,1,-1,1,-1};

int n;
void solve()
{
	cin>>n;vector<int> a(n+1),b(n+1),c(n+1),ex(n+1);
	for(int i=1;i<=n;++i) cin>>a[i];
	for(int i=1;i<=n;++i) cin>>b[i];
	for(int i=1;i<=n;++i) cin>>c[i];
	int cnt=0;LL sum=0;vector<pli> vt;
	for(int i=1;i<=n;++i)
	{
		if(a[i]) a[i]+=c[i],c[i]=0,sum+=min(a[i],b[i]);
		else if(b[i]&&c[i]) ++cnt,vt.eb(min(b[i],c[i]),i);
	}
	sort(vt.begin(),vt.end(),greater<pli>());
	for(int i=1;i<cnt;++i) vt[i].fr+=vt[i-1].fr;
	for(int i=0;i<cnt;++i) ex[vt[i].sc]=i+1;
//	cout<<cnt<<' '<<sum<<'\n';
	int K=min(cnt+0ll,sum);
	if(!vt.empty()) vt.eb(vt.back());
	for(int i=1;i<=n;++i)
	{
		LL ans=sum+a[i]-min(a[i],b[i]);
		if(K)
		{
			if(!ex[i]) ans+=vt[K-1].fr-K;
			else if(ex[i]<=K) ans+=vt[K].fr-K+c[i]-min(b[i],c[i]);
			else ans+=vt[K-1].fr-K+c[i];
		}
		cout<<ans<<' ';
	}
	cout<<'\n';
	sum=cnt=0;vector<LL> Vt;
	for(int i=1;i<=n;++i)
		if(a[i]) sum+=a[i];
		else cnt++,Vt.pb(c[i]);
	sort(Vt.begin(),Vt.end(),greater<LL>());
	for(int i=1;i<cnt;++i) Vt[i]+=Vt[i-1];
	if(cnt) sum+=Vt[min(cnt+0ll,sum)-1];
	cout<<sum<<'\n';
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);cout.tie(0);
	int TT=1;
//	cin>>TT;
	for(;TT;--TT) solve();
	return 0;
}