#define _USE_MATH_DEFINES
 
#include <iostream>
#include <iomanip>
#include <sstream>
 
#include <algorithm>
#include <cmath>
 
#include <string>
//#include <array>
#include <list>
#include <queue>
#include <vector>
#include <complex>
#include <set>
#include <map>
 
/////////
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define P(p) cout<<(p)<<endl;
 
#define PII pair<int,int>
/////////
typedef long long LL;
typedef long double LD;
/////////
using namespace::std;
/////////
int N,K;
vector<int> A,B;

int main(void){
    std::cin.tie(0); 
    std::ios::sync_with_stdio(false);
    std::cout << std::fixed;//
    //cout << setprecision(16);//

	cin>>N>>K;
	A.resize(N);
	B.resize(N);
	rep(i,N){
		cin>>A[i];
	}
	rep(i,N){
		cin>>B[i];
	}
	LL ans = 0;
	int sa;
	sa = N;
	if( N > 50){
		sa = 50;
	}
	LL temp = 0;
	if( N > sa){
		rep(i,N-sa){
			if( A[i]>B[i]){
				temp += A[i]-B[i];
			}else{
				temp += B[i]-A[i];
			}
		}
		temp *= K;
	}
	for(int i=0;i<K;++i){
		for(int j=N-sa; j<N;++j ){
			if( A[j] > B[j] ){
				ans += A[j]-B[j];
			}else{
				ans += B[j]-A[j];
			}
		}
		next_permutation(A.end()-sa, A.end());
	}
	P(ans+temp);
	return 0;
}