#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <utility>
#include <string>
#include <queue>
#include <stack>
#include <unordered_set>
#include <unordered_map>

using namespace std;

typedef long long int ll;
typedef pair<int, int> Pii;

const ll mod = 998244353;

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);

  int n, k;
  cin >> n >> k;
  vector<ll> a(n), b(n), c(n);
  for (auto &x: a) cin >> x;
  for (auto &x: b) cin >> x;
  for (auto &x: c) cin >> x;

  vector<ll> bc_diff(n);
  for (int i = 0; i < n; i++) {
    bc_diff[i] = b[i] - c[i];
  }
  sort(bc_diff.begin(), bc_diff.end(), greater<ll>());

  ll ans = 0;
  for (int i = 0; i < n; i++) {
    ans += a[i];
  }
  for (int i = 0; i < n; i++) {
    ans += c[i];
  }
  for (int i = 0; i < k; i++) {
    ans += bc_diff[i];
  }

  cout << ans << endl;

  return 0;
}