#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;

struct BIT{
    int n;
    vector<long long> t;
    BIT(){}
    BIT(int _n):n(_n+1), t(_n+1){}
    void add(int k, long long val){
        k++;
        while(k < n){
            t[k] += val;
            k += (k&-k);
        }
    }
    long long sum(int k){
        ll r = 0;
        while(k > 0){
            r += t[k];
            k -= (k&-k);
        }
        return r;
    }
    long long sum(int l, int r){
        return sum(r) - sum(l);
    }
};


int N, K;
vi A, B;

BIT bit;

void g(int i, int j, vi & v){
    if(i == j)return;
    ll x = bit.sum(i, i + 1), y = bit.sum(j, j + 1);
    bit.add(i, -x);
    bit.add(j, -y);
    swap(v[i], v[j]);
    bit.add(i, abs(v[i] - B[i]));
    bit.add(j, abs(v[j] - B[j]));
}

void f(vector<int> &v){
    if(sz(v) == 1)return;
    int i = sz(v) - 1;
    while(1){
        int j = i--;
        if(v[i] < v[j]){
            int k = sz(v);
            while(!(v[i] < v[--k]));
            g(i, k, v);
            rep(l, (sz(v) - j) / 2)
                g(j + l, sz(v) - 1 - l, v);
            return;
        }
        if(i == 0){
            rep(l, sz(v) / 2)
                g(l, sz(v) - 1 - l, v);
            return;
        }
    }
}

int main(){
    while(cin >> N >> K){
        A = B = vi(N);
        rep(i, N)scanf("%d", &A[i]);
        rep(i, N)scanf("%d", &B[i]);

        bit = BIT(N);
        rep(i, N)bit.add(i, abs(A[i] - B[i]));
        
        ll ans = 0;
        rep(k, K){
            ans += bit.sum(N);
            f(A);
        }
        cout << ans << endl;
    }
}