#include <bits/stdc++.h>
#define int long long
using namespace std;
int read()
{
	int res = 0, bj = 1;
	char ch = getchar();
	while (ch < '0' || ch > '9')
	{
		if (ch == '-') bj = -1;
		ch = getchar();
	}
	while (ch >= '0' && ch <= '9')
	{
		res = res * 10 + ch - '0';
		ch = getchar();
	}
	return res * bj;
}
const int MAXN = 351493 + 5;
int n, ans, a[MAXN], b[MAXN], c[MAXN];
int p[MAXN], sump;
signed main()
{
	n = read();
	for (int i = 1; i <= n; i++) a[i] = read();
	for (int i = 1; i <= n; i++) b[i] = read();
	for (int i = 1; i <= n; i++) c[i] = read();
	//统计有球且能转化的
	int cnt = 0;
	for (int i = 1; i <= n; i++)
		if (a[i] > 0 && b[i] > 0) cnt++; 
	for (int i = 1; i <= n; i++)
	{
		if (a[i] == 0) p[i] = min(c[i], b[i] - 1);
		else p[i] = min(a[i] + c[i], b[i]);
		sump += p[i];
	}		
	for (int i = 1; i <= n; i++)
	{
		ans = 0;
		if (cnt > 0) ans = sump - p[i] + a[i] + c[i];  
		else 
		{
			if (a[i] == 0) ans = 0;
			else ans = a[i] + c[i];
		}
		cout << ans << " ";
	}
	cout << "\n"; 
	ans = 0;
	if (cnt == 0)
	{	
		for (int i = 1; i <= n; i++)
			if (a[i] > 0) ans += a[i] + c[i];
	}
	else 
	{
		//统计有多少个可以转化的球 
		int num = 0;
		for (int i = 1; i <= n; i++) 
		{
			if (a[i] == 0) num += min(b[i] - 1, c[i]);
			else num += min(b[i], a[i] + c[i]);
		}
		//统计不能转化的
		vector<int> v;
		for (int i = 1; i <= n; i++)
			if (a[i] == 0 && b[i] == 0) v.push_back(c[i]);
		sort(v.begin(), v.end(), [](int x, int y) {
			return x > y;
		});
		for (int i = 0; i < min((int)v.size(), num); i++) ans += v[i];
		for (int i = 1; i <= n; i++)
			if (a[i] != 0 || b[i] != 0) ans += a[i] + c[i];
	}
	cout << ans;
	return 0;
}