#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll inf=1e9;
const int N=2e5+99;
ll n,k,m,a[N],b[N];
struct node{
	int id,tp; ll val;
	bool operator <(const node&A) const{
		if(val!=A.val) return val<A.val;
		return tp<A.tp;
	} 
};
int visa[N],visb[N];
ll nval,ncnt;
void solve(ll mid){//尽量多对
	memset(visa,0,sizeof(visa));
	memset(visb,0,sizeof(visb));
	priority_queue<node> pqa,pqb;
	nval=ncnt=0;
	for(int i=1;i<=k;i++){
		nval+=a[i]+b[i]-mid;
		ncnt++;
		pqa.push((node){i,-1,-a[i]+mid});
		pqb.push((node){i,-1,-b[i]+mid});
		visa[i]=visb[i]=1;
	}
	node nowa,nowb;
	for(int i=k+1;i<=n;i++){
		while(visa[pqa.top().id]==0) pqa.pop();
		while(visb[pqb.top().id]==0) pqb.pop();
		if((a[i]+b[i]-mid+pqa.top().val+pqb.top().val>0||(a[i]+b[i]-mid+pqa.top().val+pqb.top().val==0&&pqa.top().tp+pqb.top().tp==0))&&
			(a[i]+b[i]-mid+pqa.top().val+pqb.top().val>a[i]+pqa.top().val||(a[i]+b[i]-mid+pqa.top().val+pqb.top().val==a[i]+pqa.top().val&&1+pqb.top().tp>0))&&
			(a[i]+b[i]-mid+pqa.top().val+pqb.top().val>b[i]+pqb.top().val||(a[i]+b[i]-mid+pqa.top().val+pqb.top().val==b[i]+pqb.top().val&&1+pqa.top().tp>0))){
			nval+=a[i]+b[i]-mid+pqa.top().val+pqb.top().val; ncnt+=1+pqa.top().tp+pqb.top().tp;
			nowa=pqa.top(); pqa.pop(); pqa.push((node){i,-1,-a[i]+mid}); visa[i]=1;
			nowb=pqb.top(); pqb.pop(); pqb.push((node){i,-1,-b[i]+mid}); visb[i]=1;
			visa[nowa.id]=0; if(visb[nowa.id]) pqb.push((node){nowa.id,0,-b[nowa.id]});
			visb[nowb.id]=0; if(visa[nowb.id]) pqa.push((node){nowb.id,0,-a[nowb.id]});
		}
		else if(a[i]+pqa.top().val>0){
			nval+=a[i]+pqa.top().val; ncnt+=pqa.top().tp;
			nowa=pqa.top(); pqa.pop(); pqa.push((node){i,0,-a[i]}); visa[i]=1;
			visa[nowa.id]=0; if(visb[nowa.id]) pqb.push((node){nowa.id,0,-b[nowa.id]});
		}
		else if(b[i]+pqb.top().val>0){
			nval+=b[i]+pqb.top().val; ncnt+=pqb.top().tp;
			nowb=pqb.top(); pqb.pop(); pqb.push((node){i,0,-b[i]}); visb[i]=1;
			visb[nowb.id]=0; if(visa[nowb.id]) pqa.push((node){nowb.id,0,-a[nowb.id]});
		}
	}
	return;
}
struct sq{
	ll a,b;
	bool operator<(const sq A) const{
		return a+b>A.a+A.b;
	}
}s[N];
void solve(){
	cin>>n>>k>>m;
	for(int i=1;i<=n;i++) cin>>a[i];
	for(int i=1;i<=n;i++) cin>>b[i];
	for(int i=1;i<=n;i++) s[i]=(sq){a[i],b[i]};
	sort(s+1,s+n+1);
	for(int i=1;i<=n;i++) a[i]=s[i].a,b[i]=s[i].b;
	solve(0);
	if(ncnt>=m){
		cout<<nval<<'\n';
		return;
	}
	int l=-inf,r=-1,mid; ll ans=0;
	while(l<=r){
		mid=(l+r>>1);
		solve(mid);
		if(ncnt>=m) ans=nval+m*mid,l=mid+1;
		else r=mid-1;
	}
	cout<<ans<<'\n';
	return;
}
int main(){
//	freopen("sequence.in","r",stdin);
//	freopen("sequence.out","w",stdout);
	std::ios::sync_with_stdio(false);
	cin.tie(0);
	int T; cin>>T;
	while(T--) solve();
	return 0;
}