#include <bits/stdc++.h>
using namespace std;
 
int main() {
	int n, k;
	cin>>n>>k;
	vector<int> arr(n+1, 0);
	for(int i=1;i<=n;i++){
		int element;
		cin>>element;
		arr[i]=element;
	}
	vector<int> dp(n+1,0);
	dp[1]=0;
	dp[2]=abs(arr[2]-arr[1]);
	for(int i=3;i<=n;i++){
		int answer=INT_MAX;
		for(int j=1;j<=k && i-j>=1;j++){
			//we are jumping from i-j to i
			int option=abs(arr[i]-arr[i-j]) + dp[i-j];
			answer=min(answer, option);
		}
		dp[i]=answer;
	}
	cout<<dp[n];
	return 0;
}
 

I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgbWFpbigpIHsKCWludCBuLCBrOwoJY2luPj5uPj5rOwoJdmVjdG9yPGludD4gYXJyKG4rMSwgMCk7Cglmb3IoaW50IGk9MTtpPD1uO2krKyl7CgkJaW50IGVsZW1lbnQ7CgkJY2luPj5lbGVtZW50OwoJCWFycltpXT1lbGVtZW50OwoJfQoJdmVjdG9yPGludD4gZHAobisxLDApOwoJZHBbMV09MDsKCWRwWzJdPWFicyhhcnJbMl0tYXJyWzFdKTsKCWZvcihpbnQgaT0zO2k8PW47aSsrKXsKCQlpbnQgYW5zd2VyPUlOVF9NQVg7CgkJZm9yKGludCBqPTE7ajw9ayAmJiBpLWo+PTE7aisrKXsKCQkJLy93ZSBhcmUganVtcGluZyBmcm9tIGktaiB0byBpCgkJCWludCBvcHRpb249YWJzKGFycltpXS1hcnJbaS1qXSkgKyBkcFtpLWpdOwoJCQlhbnN3ZXI9bWluKGFuc3dlciwgb3B0aW9uKTsKCQl9CgkJZHBbaV09YW5zd2VyOwoJfQoJY291dDw8ZHBbbl07CglyZXR1cm4gMDsKfQo=

MTAgNAo0MCAxMCAyMCA3MCA4MCAxMCAyMCA3MCA4MCA2MAo=

10 4
40 10 20 70 80 10 20 70 80 60