#include <iostream>
#include <bits/stdc++.h>
using namespace std;
void helper_fn(vector<int>&dp,vector<int>&arr,int k){
int n=arr.size();
dp[0]=0;
if(n>=1){
dp[1]=abs(arr[1]-arr[0]);
}
for(int i=2;i<n;i++){
int j=1;
int ans=INT_MAX;
while(j<=k && i-j>0){
int option=dp[i-j]+abs(arr[i-j]-arr[i]);
ans=min(ans,option);
j++;
}
dp[i]=ans;
}
}
int main(){
int n,k;
cin>>n;
cin>>k;
vector<int>arr(n);
for(int i=0;i<n;i++){
cin>>arr[i];
}
vector<int>dp(n);
helper_fn(dp,arr,k);
cout<<"Minimum effort: "<<dp[n-1]<<endl;
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8Yml0cy9zdGRjKysuaD4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCnZvaWQgaGVscGVyX2ZuKHZlY3RvcjxpbnQ+JmRwLHZlY3RvcjxpbnQ+JmFycixpbnQgayl7CiAgICBpbnQgbj1hcnIuc2l6ZSgpOwogICAgZHBbMF09MDsKICAgIGlmKG4+PTEpewogICAgICAgIGRwWzFdPWFicyhhcnJbMV0tYXJyWzBdKTsKICAgIH0KCiAgICBmb3IoaW50IGk9MjtpPG47aSsrKXsKICAgICAgICBpbnQgaj0xOwogICAgICAgIGludCBhbnM9SU5UX01BWDsKICAgICAgICB3aGlsZShqPD1rICYmIGktaj4wKXsKICAgICAgICAgICAgaW50IG9wdGlvbj1kcFtpLWpdK2FicyhhcnJbaS1qXS1hcnJbaV0pOwogICAgICAgICAgICBhbnM9bWluKGFucyxvcHRpb24pOwogICAgICAgICAgICBqKys7CiAgICAgICAgfQogICAgICAgIGRwW2ldPWFuczsKICAgIH0KfQppbnQgbWFpbigpewogICAgaW50IG4sazsKICAgIGNpbj4+bjsKICAgIGNpbj4+azsKICAgIHZlY3RvcjxpbnQ+YXJyKG4pOwogICAgZm9yKGludCBpPTA7aTxuO2krKyl7CiAgICAgICAgY2luPj5hcnJbaV07CiAgICB9CgogICAgdmVjdG9yPGludD5kcChuKTsKICAgIGhlbHBlcl9mbihkcCxhcnIsayk7CiAgICBjb3V0PDwiTWluaW11bSBlZmZvcnQ6ICI8PGRwW24tMV08PGVuZGw7CiAgICByZXR1cm4gMDsKfQ==