#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
using mint = atcoder::modint998244353;

#define rep(i, l, r) for (int i = (int)(l); i<(int)(r); i++)
#define ll long long

template<class T> bool chmin(T& a, T b) {if (a > b) {a = b; return 1;} return 0;}
template<class T> bool chmax(T& a, T b) {if (a < b) {a = b; return 1;} return 0;}

const int inf = 1e9;
const ll INF = 4e18;

const vector<int> di = {1, -1, 0, 0}, dj = {0, 0, 1, -1};

int main() {
    int N, K; cin >> N >> K;
    vector<ll> A(N), B(N), C(N);
    rep(i, 0, N) cin >> A[i];
    rep(i, 0, N) cin >> B[i];
    rep(i, 0, N) cin >> C[i];
    ll sum = 0;
    rep(i, 0, N) sum += A[i] + C[i];
    vector<ll> plus(N);
    rep(i, 0, N) {
        plus[i] = B[i] - C[i];
    }
    sort(plus.begin(), plus.end(), greater<ll>());
    rep(i, 0, K) sum += plus[i];
    cout << sum << endl;
}