#define _USE_MATH_DEFINES
#pragma region include
#include <iostream>
#include <iomanip>
#include <stdio.h>

#include <sstream>
#include <algorithm>
#include <iterator>
#include <cmath>
#include <complex>

#include <string>
#include <cstring>
#include <vector>
#include <bitset>

#include <queue>
#include <set>
#include <map>
#include <stack>
#include <list>

#include <ctime>
////
//#include <random>//
#pragma endregion //#include
/////////

#pragma region typedef
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
#pragma endregion //typedef
////定数
const int INF = (int)1e9;
const LL MOD = (LL)1e9+7;
const LL LINF = (LL)4e18+20;
const LD PI = acos(-1.0);
const double EPS = 1e-9;
/////////
using namespace::std;

vector<LL> A;
map<vector<int>,LL> memo;
//[L,R]をK個に分割した時のなんかの最小値
LL dfs(int L,int R,int K){
	vector<int> dat(3);
	dat[0] = L;
	dat[1] = R;
	dat[2] = K;
	if( K == 1 ){
		return A[R]-A[L];
	}
	if( R-L+1 == K ){//一個がK個
		return 0;
	}
	if( memo.find(dat) != memo.end() ){
		return memo[dat];
	}
	LL ret = LINF;
	int Lside = K/2;
	int Rside = K-Lside;
	for(int i=L+Lside;R-i+1>=Rside;++i){
		LL res = dfs(L,i-1,Lside)+dfs(i,R,Rside);
		ret = min(ret,res);
	}
	memo[dat] = ret;
	return ret;
}
void solve(){
	int N,K;
	cin>>N>>K;
	A = vector<LL>(N);
	for(int i=0;i<N;++i){
		cin>>A[i];
	}
	sort(A.begin(), A.end());
	LL ans = dfs(0,N-1,K);
	cout << ans << endl;
}

#pragma region main
signed main(void){
	std::cin.tie(0);
	std::ios::sync_with_stdio(false);
	std::cout << std::fixed;//小数を10進数表示
	cout << setprecision(16);//小数点以下の桁数を指定//coutとcerrで別	

	solve();
}
#pragma endregion //main()