Knights of n table

import copy


def getCoins(power, dataIn, k):
  i = 0
  result = []
  for knight, hisCoin in dataIn:
    if i >= k:
      break
    if int(knight) < int(power):
      result.append(hisCoin)
      i = i + 1
  return result


def main():
  n, k = map(int, input().split())
  knights = input().split()
  coins = input().split()
  data = list(zip(knights, coins))
  tempData = data[:]
  sortedData = sorted(tempData, key = lambda it: int(it[1]), reverse = True)

  for i in data:
    knight, knightsCoin = i
    res = 0
    coinsFromWeakKnights = getCoins(knight, sortedData, k)
    for coin in coinsFromWeakKnights:
      res += int(coin)
    res += int(knightsCoin)
    print(res, end=" ")

if __name__ == "__main__":
  main()