#include <bits/stdc++.h>
using namespace std;
constexpr int INF = numeric_limits<int>::max() / 2;
constexpr long long LINF = numeric_limits<long long>::max() / 3;
struct Double {
  double d;
  explicit Double(double x) : d(x) {}
};
ostream& operator<<(ostream& os, const Double x) {
  os << fixed << setprecision(20) << x.d;
  return os;
}
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& vec) {
  os << "[";
  for (const auto& v : vec) {
    os << v << ",";
  }
  os << "]";
  return os;
}
template <typename T, typename U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
  os << "(" << p.first << "," << p.second << ")";
  return os;
}
template <typename T>
ostream& operator<<(ostream& os, const set<T>& st) {
  os << "{";
  for (T v : st) os << v << ",";
  os << "}";
  return os;
}
template <typename T, typename U>
inline void chmax(T& x, U y) {
  if (y > x) x = y;
}
template <typename T, typename U>
inline void chmin(T& x, U y) {
  if (y < x) x = y;
}
long long gcd(long long a, long long b) {
  if (b == 0)
    return a;
  else
    return gcd(b, a % b);
}
constexpr double eps = 1e-10;
constexpr long long mod = 1e9 + 7;
const int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
using P = pair<long long, long long>;
map<long long, long long> mp;
int main() {
  int n, k;
  cin >> n >> k;
  vector<long long> p(n);
  vector<long long> c(n);
  for (int i = 0; i < (int)(n); i++) cin >> p[i];
  for (int i = 0; i < (int)(n); i++) cin >> c[i];
  vector<P> pi(n);
  for (int i = 0; i < (int)(n); i++) pi[i] = P(p[i], i);
  sort((pi).begin(), (pi).end());
  priority_queue<P> que;
  for (int i = 0; i < n; i++) {
    int idx = pi[i].second;
    long long cnt = 0;
    long long coins = c[idx];
    queue<P> save;
    while (cnt < k and !que.empty()) {
      auto tp = que.top();
      que.pop();
      save.push(tp);
      if (tp.second >= p[idx]) continue;
      coins += tp.first;
      cnt++;
    }
    mp[idx] = coins;
    while (!save.empty()) {
      que.push(save.front());
      save.pop();
    }
    que.push(P(c[idx], p[idx]));
  }
  for (int i = 0; i < n; i++) {
    if (i) cout << " ";
    cout << mp[i];
  }
  cout << endl;
}
