#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(x) x.begin(), x.end()
#define MOD1 1LL<<61-1
#define MOD2 (1LL<<61)-1
#define MOD3 (1LL<<61-1)
using namespace std;
using ll=long long;
using ld=long double;
using P=pair<ll,ll>;
//#include <atcoder/all>
//using namespace atcoder;
////using mint=static_modint<998244353>;
//using mint=static_modint<1000000007>;
////using mint=modint;
//#pragma GCC target("avx2")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
int inf=2147483647;
ll INF=9223372036854775807;
const ld PI=acos(-1);

void yn(bool f){
	if(f)cout<<"Yes"<<endl;
	else cout<<"No"<<endl;
	return;
}

int main(){
	int n,k;cin>>n>>k;
	vector<ll> a(n),b(n),c(n);
	vector<P> d(n);
	ll ans=0;
	rep(i,n){
		cin>>a[i];
		ans+=a[i];
	}
	rep(i,n)cin>>b[i];
	rep(i,n)cin>>c[i];
	rep(i,n)d[i]={b[i]-c[i],i};
	sort(all(d));
	reverse(all(d));

	rep(i,k)ans+=b[d[i].second];
	for(int i=k;i<n;i++)ans+=c[d[i].second];

	cout<<ans<<endl;
}