#include <bits/stdc++.h>
using namespace std;
void fun() {}
long long int md = 998244353;
long long int __gcd(long long int a, long long int b) {
  if (b == 0) return a;
  return __gcd(b, a % b);
}
long long int poww(long long int a, long long int b, long long int md) {
  if (b < 0) return 0;
  if (a == 0) return 0;
  long long int res = 1;
  while (b) {
    if (b & 1) {
      res = (1ll * res * a) % md;
    }
    a = (1ll * a * a) % md;
    b >>= 1;
  }
  return res;
}
long long int poww(long long int a, long long int b) {
  if (b < 0) return 0;
  if (a == 0) return 0;
  long long int res = 1;
  while (b) {
    if (b & 1) {
      res = (1ll * res * a);
    }
    a = (1ll * a * a);
    b >>= 1;
  }
  return res;
}
void ainp(long long int arr[], long long int n) {
  for (long long int i = 1; i <= n; i++) cin >> arr[i];
}
void disp(long long int arr[], long long int n) {
  for (long long int i = 1; i <= n; i++) cout << arr[i] << " ";
  cout << "\n";
}
void dispv(vector<long long int> &v) {
  for (long long int i = 0; i < v.size(); i++) cout << v[i] << " ";
  cout << "\n";
}
long long int divide(long long int a, long long int b, long long int md) {
  long long int rr = a * (poww(b, md - 2, md));
  rr %= md;
  return rr;
}
const long long int size = 1e5 + 10;
long long int n, k;
pair<long long int, pair<long long int, long long int> > knight[size];
long long int prefix[size], ans[size];
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  fun();
  cin >> n >> k;
  for (long long int i = 1; i <= n; i++) cin >> knight[i].first;
  for (long long int i = 1; i <= n; i++) {
    cin >> knight[i].second.first;
    knight[i].second.second = i;
  }
  sort(knight + 1, knight + 1 + n);
  multiset<long long int> sett;
  long long int setsum = 0;
  for (long long int i = 1; i <= n; i++) {
    while (sett.size() > k) {
      setsum -= *sett.begin();
      sett.erase(sett.find(*sett.begin()));
    }
    sett.insert(knight[i].second.first);
    setsum += knight[i].second.first;
    ans[knight[i].second.second] = setsum;
  }
  for (long long int i = 1; i <= n; i++) cout << ans[i] << " ";
  cout << "\n";
  return 0;
}
