#define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<ll, int> ll_i;
typedef pair<double, int> d_i;
typedef pair<ll, ll> ll_ll;
typedef pair<double, double> d_d;
struct edge { int u, v; ll w; };
 
ll MOD = 1000000007;
ll _MOD = 1000000009;
double EPS = 1e-10;
int INF = INT_MAX / 10;

int main() {
	int N, K; cin >> N >> K;
	vector<int> p(N), B(N);
	for (int i = 0; i < N; i++)
		scanf("%d", &p[i]);
	for (int i = 0; i < N; i++)
		scanf("%d", &B[i]);
	ll ans = 0, sum = 0;
	for (int i = 0; i < N; i++)
		sum += abs(p[i] - B[i]);
	while (K--) {
		ans += sum;
		int i;
		for (i = N - 2; i > 0 && p[i] > p[i + 1]; i--);
		for (int j = i; j < N; j++)
			sum -= abs(p[j] - B[j]);
		next_permutation(p.begin(), p.end());
		for (int j = i; j < N; j++)
			sum += abs(p[j] - B[j]);
	}
	cout << ans << endl;
}