#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;

int main()
{
    int n, k; cin>>n>>k;
    vector<int> p(n);
    ll b[100010];
    for(int i=0; i<n; i++){
        cin>>p[i]; p[i]--;
    }
    ll s=0;
    for(int i=0; i<n; i++){
        cin>>b[i]; b[i]--;
        s+=abs(p[i]-b[i]);
    }
    ll ans=0;
    for(int i=0; i<k; i++){
        ans+=s;
        vector<int> v;
        v.push_back(p[n-1]);
        s-=abs(p[n-1]-b[n-1]);
        int x=-1, t=n-1;
        for(int j=n-2; j>=0; j--){
            s-=abs(p[j]-b[j]);
            if(p[j+1]<p[j]) v.push_back(p[j]);
            else{
                x=p[j];
                t=j;
                break;
            }
        }
        if(x==-1){
            s=0;
            for(int i=0; i<n; i++){
                s+=abs(i-b[i]);
            }
            continue;
        }
        v.push_back(x);
        sort(v.begin(), v.end());
        int y=*upper_bound(v.begin(), v.end(), x);
        s+=abs(y-b[t]);
        p[t]=y;
        int c=0;
        for(auto a:v){
            if(a==y) continue;
            p[t+1+c]=a;
            s+=abs(a-b[t+1+c]);
            c++;
        }
    }
    cout<<ans<<endl;
    return 0;
}