#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
#include <functional>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r,v) auto r = (v)
#else
#define aut(r,v) __typeof(v) r = (v)
#endif
#define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it)
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset(m,v,sizeof(m))
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
using namespace std;
typedef vector<int> vi; typedef pair<int,int> pii; typedef vector<pair<int,int> > vpii; typedef long long ll;
template<typename T, typename U> inline void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> inline void amax(T &x, U y) { if(x < y) x = y; }

#ifdef NDEBUG
#error assert is disabled!
#endif

int readNatural(int lo, int up) {
	assert(0 <= lo && lo <= up);
	int x = 0;
	while(1) {
		int d = getchar();
		if(!('0' <= d && d <= '9')) {
			ungetc(d, stdin);
			break;
		}
		d -= '0';
		assert(d <= up && x <= (up - d) / 10);
		x = x * 10 + d;
	}
	assert(lo <= x && x <= up);
	return x;
}

void readSpace() { int c = getchar(); assert(c == ' '); }
static bool read_eof = false;
void readEOL() {
	int c = getchar();
	if(c == EOF) {
		assert(!read_eof);
		read_eof = true;
	}else {
		assert(c == '\n');
	}
}

bool my_next_permutation(const vector<int> &p, vector<pair<int,int> > &swaps) {
	swaps.clear();
	int n = p.size();
	if(n == 0) return false;
	int k = n - 2;
	for(; k >= 0 && p[k] >= p[k+1]; -- k) ;
	if(k >= 0) {
		int l = n - 1;
		for(; p[k] >= p[l]; -- l) ;
		swaps.push_back(make_pair(k, l));
	}
	for(int i = k + 1, j = n - 1; i < j; ++ i, -- j)
		swaps.push_back(make_pair(i, j));
	return k >= 0;
}

int main() {
	int N, K;
	N = readNatural(1, 100000);
	readSpace();
	K = readNatural(0, 100000);
	readEOL();
	vector<int> p(N);
	rep(i, N) {
		p[i] = readNatural(1, N);
		if(i < N-1) readSpace(); else readEOL();
	}
	{	vector<bool> vis(N);
		rep(i, N) {
			assert(!vis[p[i]-1]);
			vis[p[i]-1] = true;
		}
	}
	vector<int> B(N);
	rep(i, N) {
		B[i] = readNatural(1, (int)1e8);
		if(i < N-1) readSpace(); else readEOL();
	}
	assert(!read_eof);
	long long dist = 0;
	rep(i, N)
		dist += abs(p[i] - B[i]);
	long long sum = 0;
	vpii swaps;
	rep(i, K) {
		sum += dist;
		my_next_permutation(p, swaps);
		each(j, swaps) {
			int a = j->first, b = j->second;
			dist -= abs(p[a] - B[a]);
			dist -= abs(p[b] - B[b]);
			swap(p[a], p[b]);
			dist += abs(p[a] - B[a]);
			dist += abs(p[b] - B[b]);
		}
	}
	cout << sum << endl;
	return 0;
}