#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main()
{
  int n, k;
  cin >> n >> k;
  vector<int> a(n), b(n), c(n);
  for (int i = 0; i < n; ++i) cin >> a[i];
  for (int i = 0; i < n; ++i) cin >> b[i];
  for (int i = 0; i < n; ++i) cin >> c[i];
  vector<pair<int, int>> vp(n);
  long long ans = 0;
  for (int i = 0; i < n; ++i) ans += a[i];
  for (int i = 0; i < n; ++i) vp[i] = {b[i] - c[i], c[i]};
  sort(vp.rbegin(), vp.rend());
  for (int i = 0; i < k; ++i) ans += vp[i].first + vp[i].second;
  for (int i = k; i < n; ++i) ans += vp[i].second;
  cout << ans << endl;
}