import sys

def solve():
    data = sys.stdin.read().split()
    ptr = 0
    n = int(data[ptr])
    k = int(data[ptr + 1])
    ptr += 2
    ai = data[ptr:ptr + n]
    ptr += n
    bi = data[ptr:ptr + n]
    ai_int = list(map(int,ai))
    bi_int = list(map(int,bi))
    res = []
    for i in range(n):
        res.append((bi_int[i],ai_int[i]))

    res.sort(key = lambda x: x[0],reverse = True)
    sum_a = 0
    sum_b = 0
    for i in range(k):
        sum_a += res[i][1]
        sum_b += res[i][0]
    print(f"{sum_a} {sum_b}")

solve()