#include <stdio.h>

 #include <string.h>

 #include <iostream>

 #include <string>

 #include <math.h>

 #include <algorithm>

 #include <vector>

 #include <stack>

 #include <queue>

 #include <set>

 #include <map>

 #include <sstream>

 const int INF=0x3f3f3f3f;

 typedef long long LL;

 const int mod=1e9+;

 //const double PI=acos(-1);

 #define Bug cout<<"---------------------"<<endl

 const int maxn=1e5+;

 using namespace std;

 struct node

 {

     int val;

     int num;

     LL ans;

     int pos;

 }PE[maxn];

 bool cmp1(node a,node b)

 {

     return a.val<b.val;

 }

 bool cmp2(node a,node b)

 {

     return a.pos<b.pos;

 }

 int main()

 {

     int n,m;

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

     for(int i=;i<=n;i++)

     {

         scanf("%d",&PE[i].val);

         PE[i].pos=i;

     }

     for(int i=;i<=n;i++)

     {

         scanf("%d",&PE[i].num);

         PE[i].ans=;

     }

     sort(PE+,PE++n,cmp1);//按战力排序

     priority_queue<int,vector<int> ,greater<int> > qe;//存放m个大的硬币数

     LL sum=;

     for(int i=;i<=n;i++)

     {

         if(qe.size()<m)

         {

             qe.push(PE[i].num);

             sum+=PE[i].num;

         }

         else if(!qe.empty())

         {

             int t=qe.top();

             if(t<PE[i].num)

             {

                 qe.pop();

                 sum=sum-t+PE[i].num;

                 qe.push(PE[i].num);

             }

         }

         PE[i+].ans+=sum;//注意是i+1

     }

     sort(PE+,PE++n,cmp2);//按位置排序

     for(int i=;i<=n;i++)

     {

         printf("%lld ",PE[i].ans+PE[i].num);//注意是LL

     }

     return ;

 }