#include <bits/stdc++.h> using namespace std; #define MAX_N 100001 typedef long long ll; ll s[MAX_N]; vector<ll> vp, vb; int N, K; template<typename It> ll my_next_permutation(It begin, It end){ if (begin == end) return 0; It i = begin; ++i; if (i == end) return abs(vp[0] - vb[0]); i = end; --i; while (true){ It j = i; --i; if (*i < *j){ It k = end; while (!(*i < *--k)) /* pass */; iter_swap(i, k); reverse(j, end); // sumを更新する for(int k=distance(begin, i)-1; k<N-1; k++){ if(k == -1) s[k+1] = abs(vp[k+1] - vb[k+1]); else s[k+1] = s[k] + abs(vp[k+1] - vb[k+1]); } return s[N-1]; } if (i == begin){ reverse(begin, end); // sumを更新する s[0] = abs(vp[0] - vb[0]); for(int k=0; k<N-1; k++) s[k+1] = s[k] + abs(vp[k+1] - vb[k+1]); return s[N-1]; } } } int main(void){ cin >> N >> K; ll ret = 0; for(int i=0; i<N; i++){ int p; cin >> p; vp.push_back(p); } for(int i=0; i<N; i++){ int b; cin >> b; vb.push_back(b); } if(K-- > 0){ // sumを更新する s[0] = abs(vp[0] - vb[0]); for(int k=0; k<N-1; k++) s[k+1] = s[k] + abs(vp[k+1] - vb[k+1]); ret += s[N-1]; } for(int k=0; k<K; k++){ ret += my_next_permutation(vp.begin(), vp.end()); } cout << ret << endl; }