#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define sl(n) scanf("%lld", &n)
#define for1(i, stop) for(ll i = 1; i <= stop; ++i)
#define pf printf
const ll sz = 1e5 + 10;
ll a[sz], b[sz];
int main()
{
ll t; sl(t);
while(t--) {
ll n, m;
sl(n),sl(m);
for1(i, n) {
sl(a[i]);
}
for1(i, m) {
sl(b[i]);
}
sort(a+1, a+n+1);
sort(b+1, b+m+1, greater<ll>());
ll ans = 0;
for1(i, min(n, m)) {
if(a[i] >= b[i]) break;
ans += b[i]-a[i];
}
pf("%lld\n", ans);
}
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgojZGVmaW5lIGxsIGxvbmcgbG9uZwojZGVmaW5lIHNsKG4pIHNjYW5mKCIlbGxkIiwgJm4pCiNkZWZpbmUgZm9yMShpLCBzdG9wKSBmb3IobGwgaSA9IDE7IGkgPD0gc3RvcDsgKytpKQojZGVmaW5lIHBmIHByaW50ZgoKY29uc3QgbGwgc3ogPSAxZTUgKyAxMDsKbGwgYVtzel0sIGJbc3pdOwoKaW50IG1haW4oKQp7CiAgICBsbCB0OyBzbCh0KTsKCiAgICB3aGlsZSh0LS0pIHsKICAgICAgICBsbCBuLCBtOwogICAgICAgIHNsKG4pLHNsKG0pOwoKICAgICAgICBmb3IxKGksIG4pIHsKICAgICAgICAgICAgc2woYVtpXSk7CiAgICAgICAgfQoKICAgICAgICBmb3IxKGksIG0pIHsKICAgICAgICAgICAgc2woYltpXSk7CiAgICAgICAgfQoKICAgICAgICBzb3J0KGErMSwgYStuKzEpOwogICAgICAgIHNvcnQoYisxLCBiK20rMSwgZ3JlYXRlcjxsbD4oKSk7CgogICAgICAgIGxsIGFucyA9IDA7CiAgICAgICAgZm9yMShpLCBtaW4obiwgbSkpIHsKICAgICAgICAgICAgaWYoYVtpXSA+PSBiW2ldKSBicmVhazsKICAgICAgICAgICAgYW5zICs9IGJbaV0tYVtpXTsKICAgICAgICB9CgogICAgICAgIHBmKCIlbGxkXG4iLCBhbnMpOwogICAgfQoKICAgIHJldHVybiAwOwp9Cg==