#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;

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

  vector<int> p(n);
  vector<int> b(n);
  ll a = 0;

  REP(i,n) p[i] = getInt();
  REP(i,n) b[i] = getInt();

  REP(i,k){
    REP(j,n) a += std::abs(p[j] - b[j]);
    next_permutation(p.begin(), p.end());
  }

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