#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main() {
	cin.tie(0); ios::sync_with_stdio(false);
	long long Ans = 0,Ans_1 = 0, Ans_2 = 0; // Ans_1 : /    Ans_2 : %
	long long N, K; cin >> N >> K;
	vector<long long> p(N),temp(N), B(N);
	for (long long i = 0; i < N; i++) {
		cin >> p[i];
	}
	temp = p;
	for (long long i = 0; i < N; i++) {
		cin >> B[i];
	}
	for (long long i = 0; i < K; i++) {
		for (long long j = 0; j < N; j++) {
			Ans += (p[j] >= B[j]) ? p[j] - B[j] : B[j] - p[j];
		}
		if (!next_permutation(p.begin(), p.end())) {
			p = temp;
		}
	}
	cout << Ans << endl;
}