// Original C++ solution (slower):
#include<bits/stdc++.h>



using namespace std;



typedef unsigned long long ull;

typedef long long ll;

typedef pair<int, int> ii;

typedef vector<ii> vii;

typedef vector<int> vi;

typedef vector<ll> vll;



#define PI (2*acos(0.0))

#define eps 1e-9

#define pb push_back

#define endl "\n"

#define watch(x) cout << (#x) << " is " << (x) << endl;

#define show(v) for(int fi = 0; fi < v.size(); fi++) cout << v[fi] << " "; cout << endl;

#define showpair(v) for(int fi = 0; fi < v.size(); fi++) cout << v[fi].first << " " << v[fi].second << endl;

#define ff first

#define ss second

#define fu cout << "lol" << endl;

#define precision(n) cout << fixed << setprecision(n);

#define lb lower_bound

#define up upper_bound

#define vscan for(i = 0;i<n;i++){cin>>in; v.pb(in);}

#define all(a) a.begin(), a.end()

#define min3(a,b,c) min(a,min(b,c))

#define max3(a,b,c) max(a,max(b,c))

#define mem(a,val) memset(a,val,sizeof(a))

#define loop(i,n) for(i = 0; i < n; i++)

#define TC() ull T; cin>>T; while(T--)

#define IN(x) {scanf("%d",&x);}

#define LL(x) {scanf("%lld",&x);}

#define CC(x) {scanf("%c",&x);}

#define pfl(x) printf("%d\n",x)

#define pfll(x) printf("%lld\n",x)

#define newl puts("")

#define space printf(" ")

#define MOD 1000000007

#define speed ios_base::sync_with_stdio(false); cin.tie(NULL);



const int N = 1e5 + 100;

int arr[N];

int dp[N];

int n, k;



ll f(int id){

    if(id >= n) return (1LL<<40);

    if(id == n-1) return 0;

    if(dp[id] != -1) return dp[id];

    ll ret = LLONG_MAX;

    for(int i = 1; i <= k; i++) ret = min(ret, f(id+i) + abs(arr[id+i] - arr[id]));

    return dp[id] = ret;

}



int main()

{

    int i = 0, j = 0, cs = 0, in;

    cin>>n>>k;

    for(i = 0; i < n; i++) cin>>arr[i];

    mem(dp,-1);

    cout << f(0) << endl;

    return 0;

}


// Optimized solution to the same problem (faster):
#include<bits/stdc++.h>



using namespace std;



typedef unsigned long long ull;

typedef long long ll;

typedef pair<int, int> ii;

typedef vector<ii> vii;

typedef vector<int> vi;

typedef vector<ll> vll;



#define PI (2*acos(0.0))

#define eps 1e-9

#define pb push_back

#define endl "\n"

#define watch(x) cout << (#x) << " is " << (x) << endl;

#define show(v) for(int fi = 0; fi < v.size(); fi++) cout << v[fi] << " "; cout << endl;

#define showpair(v) for(int fi = 0; fi < v.size(); fi++) cout << v[fi].first << " " << v[fi].second << endl;

#define ff first

#define ss second

#define fu cout << "lol" << endl;

#define precision(n) cout << fixed << setprecision(n);

#define lb lower_bound

#define up upper_bound

#define vscan for(i = 0;i<n;i++){cin>>in; v.pb(in);}

#define all(a) a.begin(), a.end()

#define min3(a,b,c) min(a,min(b,c))

#define max3(a,b,c) max(a,max(b,c))

#define mem(a,val) memset(a,val,sizeof(a))

#define loop(i,n) for(i = 0; i < n; i++)

#define TC() ull T; cin>>T; while(T--)

#define IN(x) {scanf("%d",&x);}

#define LL(x) {scanf("%lld",&x);}

#define CC(x) {scanf("%c",&x);}

#define pfl(x) printf("%d\n",x)

#define pfll(x) printf("%lld\n",x)

#define newl puts("")

#define space printf(" ")

#define MOD 1000000007

#define speed ios_base::sync_with_stdio(false); cin.tie(NULL);



const int N = 1e5+100;

ll dp[N];

int arr[N];



int main()

{

    int i = 0, j = 0, cs = 0, in;

    int n, k; cin>>n>>k;

    for(i = 0; i < n; i++){

        cin>>arr[i];

        dp[i] = (1LL<<40);

    }

    dp[0] = 0;

    for(i = 1; i < n; i++){

        for(j = 1; j <= k && i - j >= 0; j++){

            dp[i] = min(dp[i] , dp[i-j] + abs(arr[i-j] - arr[i]));

        }

    }

    cout << dp[n-1] << endl;

    return 0;

}


// Fastest known solution for this problem:
#include <iostream>

#include <array>

#include <vector>

#include <iomanip>

#include <string>

#include <cmath>

#include <array>

#include <algorithm>

#include <queue>

#include <map>

using namespace std;



typedef  pair<int,int> P;

typedef long long LL;



const LL  INF=1<<31;







int main(){

     int n,k;

     cin>>n>>k;

     int h[100000];

     for(int i=0;i<n;++i){

          cin>>h[i];

     }

     LL dp[100001];



      for(int i=0;i<n;++i){

           dp[i]=INF;

      }

            dp[0]=0;

            dp[1]=abs(h[0]-h[1]);







     for(int i=2;i<n;++i){

          dp[i]=dp[i-1]+abs(h[i-1]-h[i]);

          for(int j=2;j<=k;++j){



               if(j<=i)dp[i]=min(dp[i],dp[i-j]+abs(h[i-j]-h[i]));

          }

     }     



     cout<<dp[n-1]<<endl;





}