#include<iostream>
#include<cstdio>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<string>
#include<algorithm>
#include<functional>
using namespace std;
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define INF 1<<30
#define MP make_pair
#define mp make_pair
#define pb push_back
#define PB push_back
#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define ll long long
#define ull unsigned long long

struct t{int i;};
int p[100010];
int b[100010];
t id[100010];
ll ans;
ll r=0;
bool operator < (t i,t j){return p[i.i]<p[j.i];}
void swap(t i,t j){
	ans-=1LL*r*abs(b[i.i]-p[i.i]);
	ans-=1LL*r*abs(b[j.i]-p[j.i]);
	swap(i.i,j.i);
	ans+=1LL*r*abs(b[i.i]-p[i.i]);
	ans+=1LL*r*abs(b[j.i]-p[j.i]);
}

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	int n,k;cin>>n>>k;
	REP(i,n) cin>>p[i];
	REP(i,n) cin>>b[i];
	REP(i,n) id[i].i=i;
	REP(i,n) ans+=1LL*k*abs(p[i]-b[i]);
	REP(i,k-1){
		r=k-1-i;
		next_permutation(id,id+n);
	}
	cout<<ans<<endl;
	 

}