#include<bits/stdc++.h>
#include<atcoder/all>
#define chmin(x,y) (x) = min((x),(y))
#define chmax(x,y) (x) = max((x),(y))
using namespace std;
using namespace atcoder;
using ll = long long;
const ll mod = 998244353;
using mint = modint998244353;
using Graph = vector<vector<int>>;

int main(){
  // input
  int N,K; cin >> N >> K;
  vector<ll> 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];
  
  
  // solve
  ll ans = 0;
  vector<ll> D(N);
  for(int i = 0; i < N; i++){
    ans += A[i] + C[i];
    D[i] = B[i] - C[i];
  }
  sort(D.begin(),D.end(),greater<ll>{});
  
  for(int i = 0; i < K; i++)
    ans += D[i];
  
  cout << ans << endl;
  // solve
  
  
  // output
}