#include<iostream>
#include<vector>
#include<set>
#include<map>
#include<string>
#include<stack>
#include<queue>
#include<string.h>
#include<array>
#include<algorithm>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define endl '\n'
#define int long long
using namespace std;
const int oo = 1e9;
signed main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, k;
cin >> n >> k;
vector<int> a(n);
for(int i = 0; i < n; i++){
cin >> a[i];
}
int mxn = *max_element(a.begin(), a.end()) + 2;
int mn = oo;
vector<vector<int>> dp(n, vector<int>(mxn, oo));
// dp[i][j] = dp[i - 1][]
for(int i = 0; i < mxn; i++){
dp[0][i] = abs(i - a[0]);
}
// for(int i = 1; i < mxn; i++){
// for(int j = 0; j < mxn; j++){
// for(int q = 0; q < mxn; q++){
// int diff = 0;
// if(abs(a[j] - a[q]) > k){
// diff = abs(a[j] - a[q]) - k;
// }
// dp[i][j] = dp[i - 1][q] + diff;
// }
// }
// }
for(int i = 1; i < n; i++){
for(int j = 0; j < mxn; j++){
for(int s = max(0LL, j - k); s <= min(mxn - 1, j + k); s++){
dp[i][j] = min(dp[i][j], dp[i - 1][s] + abs(j - a[i]));
}
}
}
for(int i = 0; i < mxn; i++){
mn = min(mn, dp[n - 1][i]);
}
cout << mn;
}
