#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, a, n) for (int i = (a); i < (n); i++)
#define per(i, a, n) for (int i = (n) - 1; i >= (a); i--)
#define FOR(i, n) rep(i, 0, (n))
#define fi first
#define se second

char endl = '\n';
int main(void) {
    int N;
    ll K;
    scanf("%i %lld", &N, &K);
    ll a[N];
    int i;
    for(i=0;i<N;i++){
        scanf("%lld", &a[i]);
    }
    ll res=0;
    sort(a,a+N);
    ll stred;
    ll t=-100000000000005;
    ll u=100000000000005;
    while(t<u){
        ll v=(t+u)/2;
        int doleva=0; int doprava=0;
        for(i=0;i<N;i++){
            if(a[i]<v+(i-N/2)*K) doprava++;
            else if(a[i]>v+(i-N/2)*K) doleva++;
        }
        if(doleva<=N/2&&doprava<=N/2) {stred=v; break;}
        else if(doleva>N/2) t=v;
        else u=v;
        //printf("%lld\n", v);
    }
    if(N%2==0){
        for(i=0;i<N/2;i++){
            res+=abs((stred-(N/2-i)*K)-a[i])+abs((stred+(N/2-i-1)*K)-a[N-i-1]);
        }
    }
    else{
        for(i=0;i<N/2;i++){
            res+=abs((stred-(N/2-i)*K)-a[i])+abs((stred+(N/2-i)*K)-a[N-i-1]);
        }
        res+=abs(stred-a[N/2]);
    }
    printf("%lld\n", res);
	return 0;
}