#include <bits/stdc++.h>

using namespace std;
typedef long long int ll;
typedef pair<ll,ll> pll;
typedef vector<ll> vll;

#define repi(i,a,b) for(ll i=a;i<b;i++)
#define rep(i,a) repi(i,0,a)
#define rrep(i,a) for(ll i=a-1;i>=0;i--)
#define MOD 1000000007

//debug
#define debug(arr) cerr<<#arr<<"(l"<<__LINE__<<") : ";for(auto x:arr)cerr<<x<<" ";cerr<<endl;

int main(){
  ll N, K;
  cin >> N >> K;
  ll A[N], B[N], C[N];
  rep(i, N) cin >> A[i];
  rep(i, N) cin >> B[i];
  rep(i, N) cin >> C[i];

  vector<pll> yakitori;
  rep(i, N) {
    yakitori.emplace_back(i, B[i]-C[i]);
  }

  sort(yakitori.begin(), yakitori.end(), [](pll a, pll b) {
    return a.second > b.second;
  });


  ll ans = 0;
  rep(i, N) {
    ll idx = yakitori[i].first;
    if (i < K) {
      ans += A[idx] + B[idx];
    } else {
      ans += A[idx] + C[idx];
    }
  }

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