#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<to;x++)
#define FORR(x,arr) for(auto& x:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
//-------------------------------------------------------

int N,K;
int P[101010];
int B[101010];
int pre[101010];
ll tot,ct;


void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N>>K;
	if(K==0) return _P("0\n");
	FOR(i,N) cin>>P[i], pre[P[i]]=i;
	FOR(i,N) cin>>B[i], ct+=abs(P[i]-B[i]);
	
	tot=ct;
	FOR(i,K-1) {
		next_permutation(P,P+N);
		int mi=N-1;
		for(j=mi;j>=mi;j--) {
			if(pre[P[j]]==j) continue;
			mi=min(mi,pre[P[j]]);
			ct -= abs(P[j]-B[pre[P[j]]]);
			pre[P[j]]=j;
			ct += abs(P[j]-B[j]);
		}
		tot += ct;
	}
	cout<<tot<<endl;
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false);
	FOR(i,argc-1) s+=argv[i+1],s+='\n';
	FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	solve(); return 0;
}