#include "bits/stdc++.h"
using namespace std;

#pragma GCC optimize("Ofast")
#pragma GCC target("avx2")

using ll = long long;
using LL = long long;

#define int long long
const int N = 4e5 + 11;
int a[N], b[N], c[N];

int f(int x){
	return min(b[x], a[x] + c[x] + 1);
}

void solve(int TC) {
	int n; cin >> n;
	for(int i = 0; i < n; i++) cin >> a[i];
	for(int i = 0; i < n; i++) cin >> b[i];
	for(int i = 0; i < n; i++) cin >> c[i];

	for(int i = 0; i < n; i++){
		if(a[i]) a[i] += c[i], c[i] = 0;
	}
	
	int free_ball = 0;
	for(int i = 0; i < n; i++){
		int x = min(a[i], b[i]);
		a[i] -= x; b[i] -= x;
		free_ball += x;
	}

	if(!free_ball){
		for(int i = 0; i < n; i++){
			cout << a[i] << " \n"[i == n - 1];
		}
		int s = accumulate(a, a + n, 0LL);
		cout << s << '\n';
		return;
	}

	int s = 0; for(int i = 0; i < n; i++) s += f(i);
	for(int i = 0; i < n; i++){
		cout << free_ball + a[i] + c[i] + s - f(i) << " \n"[i == n - 1];
	}
	
	int ans = 0;
	priority_queue<pair<pair<int, int>, int>> pq;
	for(int i = 0; i < n; i++){
		pq.push({{min(b[i], a[i] + c[i] + 1), c[i]}, i});
	}
	// cout << free_ball << '\n';
	// for(int i = 0; i < n; i++){
	// 	cout << a[i] << ' ';
	// }
	// cout << '\n';

	// for(int i = 0; i < n; i++){
	// 	cout << b[i] << ' ';
	// }
	// cout << '\n';

	// for(int i = 0; i < n; i++){
	// 	cout << c[i] << ' ';
	// }
	// cout << '\n';

	while(!pq.empty() && free_ball > 0){
		auto [p, i] = pq.top(); pq.pop();
		a[i] += c[i] + 1; free_ball--;
		int x = min(a[i], b[i]);
		a[i] -= x; free_ball += x;
	}
	ans += accumulate(a, a + n, 0LL);
	ans += free_ball;
	cout << ans << '\n';
}

int32_t main() {
	cin.tie(0)->sync_with_stdio(0);
	cout << fixed << setprecision(10);

	int t = 1;
	// cin >> t;

	for (int i = 1; i <= t; i++) {
		solve(i);
	}
}