#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <list>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <cmath>
#include <utility>
#include <sstream>
#include <queue>
#include <queue>

using namespace std;

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);

  int n, k;
  cin >> n >>k;

  vector<int64_t> delicious(n);
  vector<int64_t> with_sauce(n), with_salt(n), diff(n);
  vector<int> range(n);
  for (int i=0; i < n; ++i) {
    cin >> delicious[i];
    range[i] = i;
  }
  for (int i=0; i < n; ++i) {
    cin >> with_sauce[i];
    with_sauce[i] += delicious[i];
  }
  for (int i=0; i < n; ++i) {
    cin >> with_salt[i];
    with_salt[i] += delicious[i];
  }
  for (int i=0;i  < n; ++i) {
    diff[i] = with_sauce[i] - with_salt[i];
  }
  std::sort(range.begin(), range.end(), [&](int a, int b) {
    return diff[a] < diff[b];
  });
  int64_t score = 0;
  for (int i=0; i < n; ++i) {
    if (i < k) {
      score += with_sauce[range[n-1-i]];
    } else {
      score += with_salt[range[n-1-i]];
    }
  }
  cout << score << endl;
  return 0;
}