#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int maxn = 1e5 + 5;
int n, m, a[maxn];
ll ans[maxn];
struct knight {
    int pow, coin, index;
    knight() {
        index = pow = coin = 0;
    }
}k[maxn];
struct node {
    priority_queue<int>q;
    ll sum;
}ss;
bool cmp(knight a, knight b) {
	return a.pow < b.pow; 
}
int main() {
	scanf("%d%d", &n, &m);
    for(int i = 1; i <= n; i++) {
    	scanf("%d", &k[i].pow);
		a[i] = k[i].pow;
	}
    for(int i = 1; i <= n; i++) {
    	scanf("%d", &k[i].coin);
    	k[i].index = i;	
	}
	
    if(m == 0) {
        for(int i = 1; i <= n; i++) {
        	printf("%d ", k[i].coin);
		}
        return 0;
    }
    if(n == 1) {
        printf("%d ", k[1].coin);
        return 0;
    }
    
    sort(k + 1, k + n + 1, cmp);
    for(int i = 1; i <= m + 1; i++) {
        for(int j = 1; j <= i; j++) {
            ans[k[i].index] += (ll)k[j].coin;
        }
    }
    for(int i = 1; i <= m; i++) {
    	ss.q.push(-k[i].coin);
		ss.sum += k[i].coin;
	}
    if(k[m + 1].coin > -ss.q.top()) {
        ss.sum -= -ss.q.top();
        ss.q.pop();
        ss.q.push(-k[m + 1].coin);
        ss.sum += k[m + 1].coin;
    }
    for(int i = m + 2; i <= n; i++) {
        ans[k[i].index] += k[i].coin;
        ans[k[i].index] += ss.sum;
        if(k[i].coin > -ss.q.top()) {
            ss.sum -= -ss.q.top();
            ss.q.pop();
            ss.q.push(-k[i].coin);
            ss.sum += k[i].coin;
        }	
    }
    for(int i = 1; i <= n ; i++) {
    	printf("%lld ", ans[i]);
	}
    
    return 0;
}