t = int(input())
while t >= 1:
t -= 1
n, m = map(int, input().split())
a = [0]*n; b =[0]*m
inp = input().split()
for i in range(0, n):
a[i] = int(inp[i])
inp = input().split()
for i in range(0, m):
b[i] = int(inp[i])
a.sort(); b.sort(reverse=True)
ans = 0
for i in range(0, min(n,m)):
if a[i] >= b[i]:
break
ans += b[i]-a[i]
print(ans)
dCA9IGludChpbnB1dCgpKQoKd2hpbGUgdCA+PSAxOgogICAgdCAtPSAxCgogICAgbiwgbSA9IG1hcChpbnQsIGlucHV0KCkuc3BsaXQoKSkKICAgIGEgPSBbMF0qbjsgYiA9WzBdKm0KCiAgICBpbnAgPSBpbnB1dCgpLnNwbGl0KCkKICAgIGZvciBpIGluIHJhbmdlKDAsIG4pOgogICAgICAgIGFbaV0gPSBpbnQoaW5wW2ldKQoKICAgIGlucCA9IGlucHV0KCkuc3BsaXQoKQogICAgZm9yIGkgaW4gcmFuZ2UoMCwgbSk6CiAgICAgICAgYltpXSA9IGludChpbnBbaV0pCgogICAgYS5zb3J0KCk7IGIuc29ydChyZXZlcnNlPVRydWUpCgogICAgYW5zID0gMAogICAgZm9yIGkgaW4gcmFuZ2UoMCwgbWluKG4sbSkpOgogICAgICAgIGlmIGFbaV0gPj0gYltpXToKICAgICAgICAgICAgYnJlYWsKICAgICAgICBhbnMgKz0gYltpXS1hW2ldCgogICAgcHJpbnQoYW5zKQo=