#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vl vector<ll>
#define vvi vector<vi>
#define vvl vector<vl>
#define vvvi vector<vvi>
#define vvvl vector<vvl>

template <class T>
auto debug(const T &vec){
    if constexpr (!std::is_arithmetic_v<typename T::value_type>){
        for (const auto &v : vec)debug<typename T::value_type>(v);
        cout << endl;}
    else{
        for (const auto &e : vec){
            cout << e << " ";}
        cout << endl;}
}

void print(){cout << '\n';}
template <class T, class... Ts>
void print(const T &a, const Ts &...b){
    cout << a;
    (cout << ... << (cout << ' ', b));
    cout << '\n';}

int main(){
    int n,k;
    cin >> n >> k;
    vi 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<tuple<int,int,int>> diff(n);
    rep(i,n)diff[i] = {b[i]-c[i],b[i],c[i]};
    sort(all(diff),greater<tuple<int,int,int>>());

    ll ans=accumulate(all(a),0LL);
    rep(i,n){
        if (i<k)ans+=get<1>(diff[i]);
        else ans+=get<2>(diff[i]);
    }
    print(ans);
}