#include <bits/stdc++.h>
using namespace std;
#define X first
#define Y second
typedef pair<int, int> pi;
typedef long long ll;
int INF=(int)2e9+5;
int main()
{
    ios_base::sync_with_stdio(false), cin.tie(0);
    //freopen("input.txt", "r", stdin);
    int tc;cin>>tc;
    while(tc--){
        int n,k,l;cin>>n>>k>>l;
        int L=l;
        vector<pi>a(n),b(n),v(n);
        for(int i=0;i<n;i++){
            cin>>v[i].X;
            a[i]={v[i].X,i};
        }
        for(int i=0;i<n;i++){
            cin>>v[i].Y;
            b[i]={v[i].Y,i};
        }
        sort(a.begin(),a.end(),greater<pi>());
        sort(b.begin(),b.end(),greater<pi>());
        vector<pair<bool,bool>>use(n);
        vector<int>c(n,0);
        ll ans=0;
        for(int i=0;i<k;i++){
            ans+=(ll)a[i].X;
            use[a[i].Y].X=true;
            if(c[a[i].Y]==0) c[a[i].Y]=1;
            else c[a[i].Y]=3;
            ans+=(ll)b[i].X;
            use[b[i].Y].Y=true;
            if(c[b[i].Y]==0) c[b[i].Y]=2;
            else c[b[i].Y]=3;
        }
        //vector<pi>Ain,Aout,Bin,Bout;
        array<vector<pi>,4>arr;//Ain,Aout,Bin,Bout
        priority_queue<int>pq;
        for(int i=0;i<n;i++){
            if(c[i]==3) l--;
            else if(c[i]==2){
                //Bout.push_back({v[i].Y,i});
                arr[3].push_back({v[i].Y,i});
                //Ain.push_back({v[i].X,i});
                arr[0].push_back({v[i].X,i});
            }
            else if(c[i]==1){
                //Aout.push_back({v[i].X,i});
                arr[1].push_back({v[i].X,i});
                //Bin.push_back({v[i].Y,i});
                arr[2].push_back({v[i].Y,i});
            }
            else pq.push(v[i].X+v[i].Y);
        }
        //sort(Ain.begin(),Ain.end(),greater<pi>());
        for(int i=0;i<4;i+=2) sort(arr[i].begin(),arr[i].end(),greater<pi>());
        for(int i=1;i<4;i+=2) sort(arr[i].begin(),arr[i].end());
        //sort(Bin.begin(),Bin.end(),greater<pi>());
        //sort(Aout.begin(),Aout.end());
        //sort(Bout.begin(),Bout.end());
        array<vector<pi>::iterator,4>it;
        for(int i=0;i<4;i++) it[i]=arr[i].begin();
        while(1){
            for(int i=0;i<4;i++){
                while(it[i]!=arr[i].end()&&c[it[i]->Y]==3) it[i]++;
            }
            //A need Ain+Aout
            //B nned Bin+Bout
            //C need Aout+Bout+pq
            int A=it[0]!=arr[0].end()&&it[1]!=arr[1].end()?it[0]->X-it[1]->X:-INF;
            int B=it[2]!=arr[2].end()&&it[3]!=arr[3].end()?it[2]->X-it[3]->X:-INF;
            int C=pq.size()>0&&it[1]!=arr[1].end()&&it[3]!=arr[3].end()?pq.top()-it[1]->X-it[3]->X:-INF;
            int mx=max({A,B,C});
            if(l<=0&&mx<=0) break;
            assert(mx>-INF);
            if(mx==A){
                ans+=(ll)A;
                int y=it[1]->Y;
                c[y]=3;
                use[y].X=false;
                pq.push(v[y].X+v[y].Y);
                y=it[0]->Y;
                c[y]=3;
                use[y].X=true;
            }
            else if(mx==B){
                ans+=(ll)B;
                int y=it[3]->Y;
                c[y]=3;
                use[y].Y=false;
                pq.push(v[y].X+v[y].Y);
                y=it[2]->Y;
                c[y]=3;
                use[y].Y=true;
            }
            else{
                ans+=(ll)C;
                pq.pop();
                int y=it[1]->Y;
                use[y].X=false;
                pq.push(v[y].X+v[y].Y);
                c[y]=3;
                y=it[3]->Y;
                use[y].Y=false;
                pq.push(v[y].X+v[y].Y);
                c[y]=3;
                L--;
            }
            l--;
        }
        //cout<<"ans : ";
        for(int i=0;i<n;i++){
            if(use[i].X&&use[i].Y) L--;
        }
        assert(L<=0);
        cout<<ans<<"\n";
    }
}