#include<iostream>
#include<set>
#include<queue>
#include<map>
#include<cmath>
#include<string>
#include<vector>
#include<cstring>
#include<algorithm>
#include<unordered_map>

#define pb push_back
#define fi first
#define se second
#define int long long
#define all(x) (x).begin(),(x).end()
#define _for(i, a) for(int i = 0; i < (a); ++i) 
#define _rep(i, a, b) for(int i = (a);i <= (b); ++i)
#define IOS ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define u1 (u<<1)
#define u2 (u<<1|1)
//#define endl '\n'
using namespace std;
typedef pair<int,int> PII;

const int INF=0x3f3f3f3f;
const int P=1e9+7;
const int N=1e6+20,M=2*N;
int n,m,k,q[N];
int a[N],b[N],c[N];
void solve(){
	cin>>n;
	_rep(i,1,n)cin>>a[i];
	_rep(i,1,n)cin>>b[i];
	_rep(i,1,n)cin>>c[i];
	int cnt=0,sum=0,ans=0;
	int t=0;
	bool bl=false;
	vector<int> v;
	_rep(i,1,n)
	{
		if(!a[i])
		{
			if(min(c[i]+1,b[i])>=1)
			{
				cnt++;
				sum+=min(c[i]+1,b[i]); 
			}
			v.pb(c[i]);
		}
		else 
		{
			a[i]+=c[i];
			ans+=a[i];
			sum+=min(a[i],b[i]); 
			if(b[i])bl=true;
		}
	}
	sort(all(v),greater<int>());
//	cout<<sum<<endl;
//	cout<<cnt<<endl;
	_rep(i,1,n)
	{
		if(!bl)cout<<a[i]<<" ";
		else 
		{
			if(!a[i])
			{
				if(min(c[i]+1,b[i])>=1)
				{
					cout<<a[i]+sum-cnt-(min(c[i]+1,b[i])-1)+c[i]<<' ';
				}
				else cout<<a[i]+sum-cnt+c[i]<<" ";
			}
			else cout<<a[i]+sum-cnt-min(a[i],b[i])<<" ";
		}
	}
	cout<<'\n';
	if(!bl)cout<<ans;
	else{
//		cout<<ans+t;
		_for(i,min(sum-cnt,(int)v.size())){
			ans+=v[i];
//			cout<<v[i]<<" ";
		}
		cout<<ans;
	}
}
signed main(){
	IOS;
	int T=1;
//	cin>>T;
	_rep(i,1,T){
		solve();
	}
	return 0;
}