#include <iostream>
#include <cstdio>
#include <set>
#include <cstring>
#include <algorithm>
#include <queue>

#define pb push_back
#define fi first
#define se second
#define mp make_pair

using namespace std;

typedef pair<int, int> PII;
typedef long long LL;
typedef set<PII>::iterator SIT;

char buf[1 << 23], *p1 = buf, *p2 = buf, obuf[1 << 23], *O = obuf;
#define getchar() (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1<<21, stdin), p1 == p2) ? EOF : *p1++)


void inline read(int &x) {
    x = 0;
    char s = getchar();

    while (s < '0' || s > '9')
        s = getchar();

    while (s <= '9' && s >= '0')
        x = x * 10 + (s ^ 48), s = getchar();
}

const int N = 2e5 + 5;

int n, K, L, a[N], b[N], f, vA[N], vB[N];

struct set {
    priority_queue<PII> ins, del;
    void clear() {
        while (!ins.empty())
            ins.pop();

        while (!del.empty())
            del.pop();
    }
    void insert(PII a) {
        ins.push(a);
    }
    bool empty() {
        return ins.empty();
    }
    void erase(PII a) {
        del.push(a);

        while (!del.empty() && !ins.empty() && ins.top() == del.top())
            ins.pop(), del.pop();
    }
    PII mx() {
        return ins.top();
    }
} uA, uB, dA, dB, s;

LL ans;

void inline clear() {
    ans = 0;
    uA.clear(), uB.clear();
    dA.clear(), dB.clear();
    s.clear();
    memset(vA, 0, sizeof vA);
    memset(vB, 0, sizeof vB);
}

int inline get1() {
    if (uA.empty() || uB.empty())
        return -1;

    return (uA.mx().fi) + (uB.mx().fi);
}

int inline get2() {
    if (s.empty())
        return -1;

    return s.mx().fi;
}

int inline get3() {
    if (dA.empty() || uB.empty())
        return -1;

    return (dA.mx().fi) + (uB.mx().fi);
}

int inline get4() {
    if (uA.empty() || dB.empty())
        return -1;

    return (uA.mx().fi) + (dB.mx().fi);
}

PII A[N], B[N], S[N], d[N];

int o = 0;

void inline changeA(int x, int t) {
    if (vA[x] == 0) {
        uA.erase(A[x]);
        ++o;

        if (vB[x] == 0)
            s.erase(S[x]), ++o;
        else
            dA.erase(A[x]), ++o;
    }

    if (vB[x] == 1 && t == 1) {
        vA[x] = vB[x] = 2;
        f++;
    }

    if (t == 1 && !vA[x]) {
        if (!vB[x])
            dB.insert(B[x]), ++o;
    } else if (t == 2 && !vA[x]) {
        if (!vB[x])
            dB.insert(B[x]), ++o;
    }

    vA[x] = t;
}

void inline changeB(int x, int t) {
    if (vB[x] == 0) {
        uB.erase(B[x]), ++o;

        if (vA[x] == 0)
            s.erase(S[x]), ++o;
        else
            dB.erase(B[x]), ++o;
    }

    if (t == 1 && vA[x] == 1) {
        vA[x] = vB[x] = 2;
        f++;
    }

    if (t == 1 && !vB[x]) {
        if (!vA[x])
            dA.insert(A[x]), ++o;
    } else if (t == 2 && !vB[x]) {
        if (!vA[x])
            dA.insert(A[x]), ++o;
    }

    vB[x] = t;
}


void inline work1() {
    //puts("1");
    PII u = uA.mx(), v = uB.mx();
    ans += (u.fi) + (v.fi);
    f--;
    changeA(u.se, 1);
    changeB(v.se, 1);
}

void inline work2() {
    //puts("2");
    PII u = s.mx();
    ans += u.fi;
    changeA(u.se, 2);
    changeB(u.se, 2);
}

void inline work3() {
    //puts("3");
    PII u = dA.mx(), v = uB.mx();
    ans += (u.fi) + (v.fi);
    changeA(u.se, 2);
    changeB(u.se, 2);
    changeB(v.se, 1);
}

void inline work4() {
    //puts("4");
    PII u = uA.mx(), v = dB.mx();
    ans += (u.fi) + (v.fi);
    changeA(v.se, 2);
    changeB(v.se, 2);
    changeA(u.se, 1);
}


int main() {
    int T;
    read(T);

    while (T--) {
        clear();
        read(n);
        read(K);
        read(L);
        f = K - L;

        for (int i = 1; i <= n; i++) {
            read(a[i]);
            A[i] = mp(a[i], i);
            //uA.insert(A[i]);
        }

        for (int i = 1; i <= n; i++) {
            read(b[i]);
            B[i] = mp(b[i], i);
            S[i] = mp(a[i] + b[i], i);
            //uB.insert(B[i]);
            // s.insert(S[i]);
        }

        for (int i = 1; i <= n; i++) {
            uA.insert(A[i]);
            uB.insert(B[i]);
            s.insert(S[i]);
        }


        for (int i = 1; i <= K; i++) {
            int v1 = get1(), v2 = get2(), v3 = get3(), v4 = get4();
            int d = max(v2, max(v3, v4));

            if (f)
                d = max(v1, d);

            if (v2 == d)
                work2();
            else if (v3 == d)
                work3();
            else if (v4 == d)
                work4();
            else
                work1();
        }

        printf("%lld\n", ans);
    }

    //cout << o << "!!!\n";
    return 0;
}