#include <iostream>
#include <algorithm>
#include <vector>
#define rep(i, n) for(i = 0; i < n; i++)
#define int long long
using namespace std;
typedef pair<int, int> P;

int n, K;
int a[200000];
int b[200000];
int c[200000];

signed main() {
	int i;

	cin >> n >> K;
	rep(i, n) cin >> a[i];
	rep(i, n) cin >> b[i];
	rep(i, n) cin >> c[i];

	vector<P> pa;
	rep(i, n) {
		pa.push_back(P(b[i] - c[i], i));
	}
	sort(pa.begin(), pa.end(), greater<P>());

	int ans = 0;
	rep(i, n) ans += a[i];
	rep(i, n) {
		if (i < K) ans += b[pa[i].second];
		else ans += c[pa[i].second];
	}

	cout << ans << endl;
	return 0;
}