#include <algorithm>
#include <cstdlib>
#define REP(i,n) for(int i=0; i<(int)(n); i++)

typedef long long ll;

#include <queue>
#include <cstdio>
inline int getInt(){ int s; scanf("%d", &s); return s; }

#include <set>

using namespace std;

struct t{
  int i;
  t(){}
};

int p[100000];
int b[100000];
t idx[100000];
ll ans;

bool operator < (t i, t j){
  return p[i.i] < p[j.i];
}

void swap(t i, t j){
  ans -= std::abs(b[i.i] - p[i.i]);
  ans -= std::abs(b[j.i] - p[j.i]);
  swap(i.i, j.i);
  ans += std::abs(b[i.i] - p[j.i]);
  ans += std::abs(b[j.i] - p[i.i]);
}

int main(){
  const int n = getInt();
  const int k = getInt();

  REP(i,n) p[i] = getInt();
  REP(i,n) b[i] = getInt();
  REP(i,n) idx[i].i = i;
  REP(i,n) ans += (ll)k * std::abs(p[i] - b[i]);

  REP(i,k-1){
    next_permutation(idx, idx + n);
  }

  printf("%lld\n", ans);
  return 0;
}