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

struct unko{
	long long val;
	bool operator < (const unko& y) const {
		return val < y.val;
	}
};

vector<unko> p;
vector<long long> b;
vector<int> pos;
long long v;

void swap(unko& s, unko& t){
	int x = pos[s.val];
	int y = pos[t.val];
	v -= abs(p[x].val - b[x]);
	v -= abs(p[y].val - b[y]);
	
	swap(p[x].val, p[y].val);
	swap(pos[s.val], pos[t.val]);

	v += abs(p[x].val - b[x]);
	v += abs(p[y].val - b[y]);
}

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

#include <cassert>

int main(){
	int n,k;
	cin >> n >> k;
	p.resize(n);
	b.resize(n);
	pos.resize(n+1);

	for(int i=0; i<n; i++){
		cin >> p[i].val;
		pos[p[i].val] = i;
	}
	for(int i=0; i<n; i++){
		cin >> b[i];
	}

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

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

	for(int i=1; i<k; i++){
		next_permutation(p.begin(), p.end());
		ans += v;
	}

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