//Nguyen Huu Hoang Minh
#include <bits/stdc++.h>
#define sz(x) int(x.size())
#define all(x) x.begin(),x.end()
#define reset(x) memset(x, 0,sizeof(x))
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define N 5005
#define remain(x) if (x > MOD) x -= MOD
#define ii pair<int, int>
#define iiii pair< ii , ii >
#define viiii vector< iiii >
#define vi vector<int>
#define vii vector< ii >
#define bit(x, i) (((x) >> (i)) & 1)
#define Task "test"
#define int long long

using namespace std;

typedef long double ld;
const int inf = 1e10;
const int minf = -1e10;

int t;

void readfile()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    if (fopen(Task".inp","r"))
    {
        freopen(Task".inp","r",stdin);
        freopen(Task".out","w",stdout);
    }
    cin >> t;
}

bool cmp(ii a, ii b){
    return a.fi > b.fi;
}

void solve(){
    int n; cin >> n;
    vector<ii> a(n);
    for(int i=0; i<n; i++) cin >> a[i].se;
    for(int i=0; i<n; i++) cin >> a[i].fi;
    sort(a.begin(),a.end(),cmp);
    vector<vector<int>> dp(n+1,vector<int>(n+1,0));
    dp[1][1] = a[1].se;
    for(int i=1; i<=n; i++){
        for(int j=1; j<=i; j++){
            dp[i][j] = dp[i-1][j-1] + a[i-1].se + a[i-1].fi*(j-1);
            if (i>j) dp[i][j] = max(dp[i-1][j],dp[i][j]);
        }
    }
    for(int i=1; i<=n; i++){
        cout << dp[n][i] << ' ';
    }
    cout << endl;
}

void proc()
{
    while (t--){
        solve();
    }
}

signed main()
{
    readfile();
    proc();
    return 0;
}