#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <set>
using namespace std;

ostream& operator << (ostream& os, vector<int>& v){
	for(int i=0; i<v.size(); i++){
		os << v[i] << " ";
	}
	return os;
}


long long my_permutation(vector<long long>& p, vector<long long>& b, long long last)
{
	int n = p.size();
	if(n == 1){
		return 0;
	}

    int i = n-1;

    for(;;)
    {
        int ii = i;
        --i;
        if (p[i] < p[ii])
        {
            int j = n;
            while (!(p[i] < p[--j]))
            {}

        	last -= abs(p[i] - b[i]);
        	last -= abs(p[j] - b[j]);

            swap(p[i], p[j]);
            last += abs(p[i] - b[i]);
            last += abs(p[j] - b[j]);

            for(int k=ii; k<n; k++){
            	last -= abs(p[k] - b[k]);
            }
            reverse(p.begin()+ii, p.end());

            for(int k=ii; k<n; k++){
            	last += abs(p[k] - b[k]);
            }

            return last;
        }
        if (i == 0)
        {
            for(int k=0; k<n; k++){
            	last -= abs(p[k] - b[k]);
            }
            reverse(p.begin(), p.end());

            for(int k=0; k<n; k++){
            	last += abs(p[k] - b[k]);
            }
            return last;
        }
    }
    return last;
}


long long func(vector<long long>& p, vector<long long>& b){
	int n = p.size();
	long long ret = 0;
	for(int i=0; i<n; i++){
		ret += abs(p[i] - b[i]);
	}
	return ret;
}

#include <cassert>

int main(){
	int n,k;
	cin >> n >> k;
	vector<long long> p(n), b(n);
	for(int i=0; i<n; i++){
		cin >> p[i];
	}
	for(int i=0; i<n; i++){
		cin >> b[i];
	}

	if(k==0){
		cout << 0 << endl;
		return 0;
	}

	long long val = func(p,b);
	long long ans = val;

	if(n == 1){
		for(int i=1; i<k; i++){
			ans += val;
		}
		cout << ans << endl;
		return 0;
	}

	for(int i=1; i<k; i++){
		val = my_permutation(p,b, val);
		ans += val;
	}

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