#include <iostream>

#include <algorithm>

#include <cstdio>

#include <queue>

#define REP(i,a,n) for(int i=a;i<=n;++i)

using namespace std;

typedef long long ll;

const int N = 2e5+10;

int n, m, k;

ll sum, a[N];

struct _ {int p, c, id;}q[N];

priority_queue<int,vector<int>,greater<int> > s;

int main() {

	s.push(0x7fffffff);

	scanf("%d%d", &n, &k);

	REP(i,1,n) scanf("%d",&q[i].p),q[i].id=i;

	REP(i,1,n) scanf("%d",&q[i].c);

	sort(q+1,q+1+n,[](_ a,_ b) {return a.p<b.p;});

	REP(i,1,n) {

		a[q[i].id] = sum+q[i].c;

		if (s.size()<=k) s.push(q[i].c),sum+=q[i].c;

		else if (s.top()<q[i].c) {

			sum += q[i].c-s.top();

			s.pop();s.push(q[i].c);

		}

	}

	REP(i,1,n) printf("%lld ", a[i]);

	puts("");

}