#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;
        vector<pi>v(n);
        for(int i=0;i<n;i++) cin>>v[i].first;
        for(int i=0;i<n;i++) cin>>v[i].second;
        sort(v.begin(),v.end(),[](pi &A,pi &B)->bool{
            return A.X+A.Y>B.X+B.Y;
        });
        vector<pair<bool,bool>>ck(n);
        l=k-l;
        vector<pi>a(n),b(n);
        for(int i=0;i<n;i++){
            a[i]={v[i].X,i};
            b[i]={v[i].Y,i};
        }
        sort(a.begin(),a.end(),greater<pi>());
        sort(b.begin(),b.end(),greater<pi>());
        int idx=0;
        vector<pi>::iterator a_i=a.begin(),b_i=b.begin();
        priority_queue<pi>aq,bq;
        ll ans=0;
        while(k--){
            while(ck[a_i->second].X) a_i++;
            while(ck[b_i->second].Y) b_i++;
            while(aq.size() and ck[aq.top().second].X) aq.pop();
            while(bq.size() and ck[bq.top().second].Y) bq.pop();
            while(idx<n and (ck[idx].X or ck[idx].Y)) idx++;
            int AB=idx!=n?v[idx].X+v[idx].Y:-INF;
            int ab=l>0?a_i->first+b_i->first:-INF;
            int oa=aq.empty()?-INF:aq.top().X+b_i->first;
            int ob=bq.empty()?-INF:bq.top().X+a_i->first;
            int mx=max({AB,ab,oa,ob});
            if(mx==AB){
                ck[idx]={1,1};
                ans+=ll(mx);
            }
            else if(mx==oa){
                ck[aq.top().second].X=true;
                ck[b_i->second].Y=true;
                aq.push({v[b_i->second].X,b_i->second});
                ans+=ll(mx);
            }
            else if(mx==ob){
                ck[a_i->second].X=true;
                ck[bq.top().second].Y=true;
                bq.push({v[a_i->second].Y,a_i->second});
                ans+=ll(mx);
            }
            else{
                l--;
                ck[a_i->second].X=true;
                //if(ck[a_i->second].Y) cout<<"exit\n";
                ck[b_i->second].Y=true;
                //if(ck[b_i->second].X) cout<<"exit\n";
                aq.push({v[b_i->second].X,b_i->second});
                bq.push({v[a_i->second].Y,a_i->second});
                ans+=ll(mx);
            }
        }
        cout<<ans<<"\n";
    }
}