/*********************************************************************
    程序名:
    版权:
    作者:
    日期: 2023-12-17 12:09
    说明:
*********************************************************************/
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cctype>
#include <algorithm>
#include<bits/stdc++.h>

#define MAXN 351500

using namespace std;

int jmp[MAXN],ans[MAXN];
long long sum1 = 0, sum2 = 0;

struct node{
    int a,b,c,gx,bh;
    bool operator <(node d)const{
        return b+c<d.b+d.c;
    }
}a[MAXN];

int read() {
    int x = 0;
    char ch = getchar();
    while (ch < '0' || ch > '9')
        ch = getchar();
    while (ch >= '0' && ch <= '9') {
        x = x * 10 + ch - '0';
        ch = getchar();
    }
    return x;
}

int write(int x) {
    if (x >= 10) {
        write(x / 10);
    }
    putchar((x % 10) + '0');
    return 0;
}

priority_queue<node> q;

int main() {
//	freopen(".in","r",stdin);
//	freopen(".out","w",stdout);
    int n;
    cin >> n;
    for (int i = 1; i <= n; i++) {
        a[i].a = read();a[i].bh=i;
    }
    for (int i = 1; i <= n; i++) {
        a[i].b = read();
    }
    for (int i = 1; i <= n; i++) {
        a[i].c = read();
    }

    for (int i = 1; i <= n; i++) {
        if(!a[i].a){jmp[i]=1;continue;}
        a[i].a+=a[i].c;a[i].c=0;
        sum1 += min(a[i].a, a[i].b);
        sum2 += a[i].a;
        ans[i]+=min(a[i].a, a[i].b);
        a[i].b-=min(a[i].a, a[i].b);
        a[i].a-=min(a[i].a, a[i].b);
        q.emplace(a[i]);
    }
    for(int i=1;i<=n;i++)
        if(jmp[i])
            q.emplace(a[i]);
    while(!q.empty()){
        auto rc=q.top();q.pop();
//        cout<<rc.b<<' '<<rc.c<<endl;
        if(!rc.b&&!rc.c)break;
        rc.a+=rc.c+1;a[rc.bh].a+=rc.c+1;
        
        sum1+=min(rc.a,rc.b);
        rc.gx+=min(rc.a,rc.b);
        sum2+=rc.c;
        ans[rc.bh]=rc.gx;
    }
    for (int i = 1; i <= n; i++) {
        write(sum1 - ans[i] + a[i].a);
        putchar(' ');
    }
    putchar('\n');
    write(sum2);
    return 0;
}