#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll inf=1e12;
const int N=2e5+99;
ll n,k,m,a[N],b[N];
int visa[N],visb[N];
priority_queue<pair<ll,int> > pqa,pqb,pq,la,lb;
void dela(int id){
	if(!visb[id]) lb.push(make_pair(b[id],id));
}
void delb(int id){
	if(!visa[id]) la.push(make_pair(a[id],id));
}
void go_work(){
	memset(visa,0,sizeof(visa));
	memset(visb,0,sizeof(visb));
	for(int i=1;i<=n;i++)
		pqa.push(make_pair(a[i],i)),pqb.push(make_pair(b[i],i)),pq.push(make_pair(a[i]+b[i],i));
	pqa.push(make_pair(-inf,0)); pqb.push(make_pair(-inf,0)); pq.push(make_pair(-inf,0));
	la.push(make_pair(-inf,0)); lb.push(make_pair(-inf,0));
	ll ans=0;
	while(k--){
		while(visa[pq.top().second]||visb[pq.top().second]) pq.pop();
		while(visa[pqa.top().second]) pqa.pop();
		while(visb[pqb.top().second]) pqb.pop();
		while(visa[la.top().second]) la.pop();
		while(visb[lb.top().second]) lb.pop();
		ll mx=0,tp=0;
		if(m&&pqa.top().first+pqb.top().first>mx)
			mx=pqa.top().first+pqb.top().first,tp=1;
		if(pq.top().first>=mx)
			mx=pq.top().first,tp=2;
		if(pqa.top().first+lb.top().first>mx)
			mx=pqa.top().first+lb.top().first,tp=3;
		if(pqb.top().first+la.top().first>mx)
			mx=pqb.top().first+la.top().first,tp=4;
		if(la.top().first+lb.top().first>=mx)
			mx=la.top().first+lb.top().first;
		ans+=mx;
		if(tp==1) m--,visa[pqa.top().second]=visb[pqb.top().second]=1,dela(pqa.top().second),delb(pqb.top().second);
		if(tp==2) visa[pq.top().second]=visb[pq.top().second]=1;
		if(tp==3) visa[pqa.top().second]=visb[lb.top().second]=1,dela(pqa.top().second);
		if(tp==4) visb[pqb.top().second]=visa[la.top().second]=1,delb(pqb.top().second);
		if(tp==5) m++,visa[la.top().second]=visb[lb.top().second];
	}
	while(!pq.empty()) pq.pop();
	while(!pqa.empty()) pqa.pop();
	while(!pqb.empty()) pqb.pop();
	while(!la.empty()) la.pop();
	while(!lb.empty()) lb.pop();
	cout<<ans<<'\n';
	return;
}
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];
	go_work();
	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;
}