#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <numeric>
#include <functional>
#include <cmath>
#include <queue>
#include <stack>
#include <set>
#include <map>

#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))

typedef long long ll;

using namespace std;


int inputValue(){
    int a;
    cin >> a;
    return a;
};

template <typename T>
void output(T a, int precision) {
    if(precision > 0){
        cout << setprecision(precision)  << a << "\n";
    }
    else{
        cout << a << "\n";
    }
}

void my_next_permutation(vector<int> &p){
    if (p.size() == 1) {
        return;
    }
    int s = (int)p.size();
    int k, l;
    for (k = s - 2; k >= 0; k--) {
        if (p[k + 1] > p[k]) {
            break;
        }
        if (k == 0) {
            reverse(p.begin(), p.end());
            return;
        }
    }
    
    
    for (l = s - 1; l > k; l--) {
        if (p[l] > p[k]) {
            break;
        }
    }
    
    swap(p[k], p[l]);
    
    for (; k + 1 < s - 1; k++, s--) {
        swap(p[k + 1], p[s - 1]);
    }
    
}

int main() {
    
    // source code
    int N = inputValue();
    int K = inputValue();
    vector<int> P(N);
    vector<int> B(N);
    
    rep(i, N){
        P[i] = inputValue();
    }
    
    rep(i, N){
        B[i] = inputValue();
    }
    
    ll ret = 0;
    rep(i, N){
        ret += abs(P[i] - B[i]);
    }
    
    rep(k, K - 1){
        my_next_permutation(P);
//        rep(i, N){
//            cout << P[i] << " ";
//        }
//        output("", 0);
        rep(i, N){
            ret += abs(P[i] - B[i]);
        }
    }
    
    output(ret, 0);
        
    
    return 0;
}