#include <iostream>
#include <cassert>
#include <vector>
#include <algorithm>
using namespace std;
using ll = long long;

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];
	
	assert(1 <= n && n <= 200000);
	assert(0 <= k && k <= n);
	for (int i = 0; i < n; ++i) {
		assert(1 <= a[i] && a[i] <= 1000'000'000);
		assert(1 <= b[i] && b[i] <= 1000'000'000);
		assert(1 <= c[i] && c[i] <= 1000'000'000);
	}
	
	ll sum = 0;
	for (int i = 0; i < n; ++i) sum += a[i];
	vector<pair<int, int>> bc(n);
	for (int i = 0; i < n; ++i) bc[i] = {b[i] - c[i], i};
	sort(bc.rbegin(), bc.rend());
	for (int cnt = 0; cnt < n; ++cnt) {
		auto [_, i] = bc[cnt];
		if (cnt < k) sum += b[i];
		else sum += c[i];
	}
	cout << sum << endl;
}