#include<bits/stdc++.h>

using namespace std;

const int N = 1000 + 5;
long long n = 0, m = 0, k = 0, x = 0, y = 0, a[N] = {}, b[N] = {};

inline void solve(){
	cin>>n>>m>>k; 
	k--;
	for(int i = 0 ; i < n ; i ++) {cin>>a[i];}
	for(int i = 0 ; i < m ; i ++) {cin>>b[i];}
	sort(a,a+n);
	sort(b,b+m);	
	if(b[m-1] > a[0]) swap(a[0], b[m-1]);
	if(k & 1){
		sort(a,a+n);
	    sort(b,b+m);
		swap(a[n-1], b[0]);
	}
	long long ans = 0;
	for(int i = 0 ; i < n ; i ++) {ans += a[i];}
	cout<<ans;
}
int T = 0;
int main(){
	cin>>T;
	for(int i = 0 ; i < T ; i ++) solve();
	return 0;
}