#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


// Minimum cost flow by successive shortest paths.
// Assumes that there exists no negative-cost cycle.
// TODO: Check the range of intermediate values.
template <class Flow, class Cost> struct MinCostFlow {
  // Watch out when using types other than int and long long.
  static constexpr Flow FLOW_EPS = 1e-10L;
  static constexpr Flow FLOW_INF = std::numeric_limits<Flow>::max();
  static constexpr Cost COST_EPS = 1e-10L;
  static constexpr Cost COST_INF = std::numeric_limits<Cost>::max();

  int n, m;
  vector<int> ptr, nxt, zu;
  vector<Flow> capa;
  vector<Cost> cost;

  explicit MinCostFlow(int n_) : n(n_), m(0), ptr(n_, -1) {}
  void ae(int u, int v, Flow w, Cost c) {
    assert(0 <= u); assert(u < n);
    assert(0 <= v); assert(v < n);
    assert(0 <= w);
    nxt.push_back(ptr[u]); zu.push_back(v); capa.push_back(w); cost.push_back( c); ptr[u] = m++;
    nxt.push_back(ptr[v]); zu.push_back(u); capa.push_back(0); cost.push_back(-c); ptr[v] = m++;
  }

  vector<Cost> pot, dist;
  vector<bool> vis;
  vector<int> pari;

  // cost slopes[j] per flow when flows[j] <= flow <= flows[j + 1]
  vector<Flow> flows;
  vector<Cost> slopes;

  // Finds a shortest path from s to t in the residual graph.
  // O((n + m) log m) time.
  //   Assumes that the members above are set.
  //   The distance to a vertex might not be determined if it is >= dist[t].
  //   You can pass t = -1 to find a shortest path to each vertex.
  void shortest(int s, int t) {
    using Entry = pair<Cost, int>;
    priority_queue<Entry, vector<Entry>, std::greater<Entry>> que;
    for (int u = 0; u < n; ++u) { dist[u] = COST_INF; vis[u] = false; }
    for (que.emplace(dist[s] = 0, s); !que.empty(); ) {
      const Cost c = que.top().first;
      const int u = que.top().second;
      que.pop();
      if (vis[u]) continue;
      vis[u] = true;
      if (u == t) return;
      for (int i = ptr[u]; ~i; i = nxt[i]) if (capa[i] > FLOW_EPS) {
        const int v = zu[i];
        if (!vis[v]) {
          const Cost cc = c + cost[i] + pot[u] - pot[v];
          if (dist[v] > cc) { que.emplace(dist[v] = cc, v); pari[v] = i; }
        }
      }
    }
  }

  // Finds a minimum cost flow from s to t of amount min{(max flow), limFlow}.
  //   Bellman-Ford takes O(n m) time, or O(m) time if there is no negative-cost
  //   edge, or cannot stop if there exists a negative-cost cycle.
  //   min{(max flow), limFlow} shortest paths if Flow is an integral type.
  pair<Flow, Cost> run(int s, int t, Flow limFlow = FLOW_INF) {
    assert(0 <= s); assert(s < n);
    assert(0 <= t); assert(t < n);
    assert(s != t);
    assert(0 <= limFlow);
    pot.assign(n, 0);
    for (; ; ) {
      bool upd = false;
      for (int i = 0; i < m; ++i) if (capa[i] > FLOW_EPS) {
        const int u = zu[i ^ 1], v = zu[i];
        const Cost cc = pot[u] + cost[i];
        if (pot[v] > cc + COST_EPS) { pot[v] = cc; upd = true; }
      }
      if (!upd) break;
    }
    dist.resize(n);
    vis.resize(n);
    pari.resize(n);
    Flow totalFlow = 0;
    Cost totalCost = 0;
    flows.clear(); flows.push_back(0);
    slopes.clear();
    for (; totalFlow < limFlow; ) {
      shortest(s, t);
      if (!vis[t]) break;
      for (int u = 0; u < n; ++u) pot[u] += min(dist[u], dist[t]);
      Flow f = limFlow - totalFlow;
      for (int v = t; v != s; ) {
        const int i = pari[v]; if (f > capa[i]) { f = capa[i]; } v = zu[i ^ 1];
      }
      for (int v = t; v != s; ) {
        const int i = pari[v]; capa[i] -= f; capa[i ^ 1] += f; v = zu[i ^ 1];
      }
      totalFlow += f;
      totalCost += f * (pot[t] - pot[s]);
      flows.push_back(totalFlow);
      slopes.push_back(pot[t] - pot[s]);
    }
    return make_pair(totalFlow, totalCost);
  }
};

////////////////////////////////////////////////////////////////////////////////


int N, K, L;
vector<Int> A, B;


namespace brute {
Int run() {
  MinCostFlow<int, Int> mcf(4 + N + N);
  for (int i = 0; i < N; ++i) {
    const int ua = 4 + i;
    const int ub = 4 + N + i;
    mcf.ae(0, ua, 1, -A[i]);
    mcf.ae(ua, ub, 1, 0);
    mcf.ae(ub, 1, 1, -B[i]);
    mcf.ae(ua, 2, 1, 0);
    mcf.ae(3, ub, 1, 0);
  }
  mcf.ae(2, 3, K - L, 0);
  const auto res = mcf.run(0, 1, K);
  assert(res.first == K);
  return -res.second;
}
}  // brute


namespace fast {
constexpr Int INF = 1001001001001001001LL;
Int ans;
vector<int> usedA, usedB;
int common;
priority_queue<pair<Int, int>> queA, queB, queA1, queB1, queAB;
void useA(int i) {
// cerr<<COLOR("91")<<"[useA] "<<i<<COLOR()<<endl;
  assert(0 <= i); assert(i < N);
  assert(!usedA[i]);
  ans += A[i];
  usedA[i] = 1;
  if (usedB[i]) {
    ++common;
  } else {
    queB1.emplace(B[i], i);
  }
}
void useB(int i) {
// cerr<<COLOR("94")<<"[useB] "<<i<<COLOR()<<endl;
  assert(0 <= i); assert(i < N);
  assert(!usedB[i]);
  ans += B[i];
  usedB[i] = 1;
  if (usedA[i]) {
    ++common;
  } else {
    queA1.emplace(A[i], i);
  }
}
Int run() {
  ans = 0;
  usedA.assign(N + 1, 0);
  usedB.assign(N + 1, 0);
  common = 0;
  queA = {};
  queB = {};
  queA1 = {};
  queB1 = {};
  queAB = {};
  for (int i = 0; i < N; ++i) {
    queA.emplace(A[i], i);
    queB.emplace(B[i], i);
    queAB.emplace(A[i] + B[i], i);
  }
  queA.emplace(-INF, N);
  queB.emplace(-INF, N);
  queA1.emplace(-INF, N);
  queB1.emplace(-INF, N);
  for (int k = 0; k < K; ++k) {
// cerr<<"k = "<<k<<endl;
    for (; usedA[queA.top().second]; queA.pop()) {}
    for (; usedB[queB.top().second]; queB.pop()) {}
    for (; usedA[queA1.top().second]; queA1.pop()) {}
    for (; usedB[queB1.top().second]; queB1.pop()) {}
    for (; usedA[queAB.top().second] || usedB[queAB.top().second]; queAB.pop()) {}
    if (k - common < K - L) {
      useA(queA.top().second);
      useB(queB.top().second);
    } else {
      Int mx = -INF;
      int iA = N, iB = N;
      if (chmax(mx, queA1.top().first + queB.top().first)) {
        iA = queA1.top().second;
        iB = queB.top().second;
      }
      if (chmax(mx, queA.top().first + queB1.top().first)) {
        iA = queA.top().second;
        iB = queB1.top().second;
      }
      if (chmax(mx, queAB.top().first)) {
        iA = iB = queAB.top().second;
      }
      useA(iA);
      useB(iB);
    }
  }
  return ans;
}
}  // fast


int main() {
  for (int numCases; ~scanf("%d", &numCases); ) { for (int caseId = 1; caseId <= numCases; ++caseId) {
    scanf("%d%d%d", &N, &K, &L);
    A.resize(N); for (int i = 0; i < N; ++i) scanf("%lld", &A[i]);
    B.resize(N); for (int i = 0; i < N; ++i) scanf("%lld", &B[i]);
cerr<<"N = "<<N<<", K = "<<K<<", L = "<<L<<endl;
    
    const Int ans = fast::run();
    printf("%lld\n", ans);
#ifdef LOCAL
if(N<=2000){
 const Int brt=brute::run();
 if(brt!=ans){
  cerr<<"N = "<<N<<", K = "<<K<<", L = "<<L<<endl;
  cerr<<"A = "<<A<<endl;
  cerr<<"B = "<<B<<endl;
  cerr<<"brt = "<<brt<<endl;
  cerr<<"ans = "<<ans<<endl;
 }
 assert(brt==ans);
}
#endif
  }
#ifndef LOCAL
  break;
#endif
  }
  return 0;
}