#include <algorithm>
#include <iostream>
#include <cstdio>
#include <map>
#include <numeric>
#include <cmath>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <complex>
#include <string.h>
#include <unordered_set>
#include <unordered_map>
using namespace std;

#define endl '\n'
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define uniq(v) (v).erase(unique((v).begin(), (v).end()), (v).end())

typedef long long ll;
typedef pair<int, int> P;
typedef unsigned int uint;
typedef unsigned long long ull;
struct pairhash {
public:
    template<typename T, typename U>
    size_t operator()(const pair<T, U> &x) const {
	size_t seed = hash<T>()(x.first);
	return hash<U>()(x.second) + 0x9e3779b9 + (seed<<6) + (seed>>2);
    }
};

const int inf = 1000000009;
const double eps = 1e-8;
int n, k;
int ns[10];
double res = 0;
int as[10];

void calc(int m, int rem, int bit) {
    if (m == n) {
	double mini = inf, maxi = 0;
	for (int i = 0; i < k; i++) {
	    int count = 0;
	    double sum = 0;
	    for (int j = 0; j < n; j++) {
		if (as[j] == i) {
		    count++;
		    sum += ns[j];
		}
	    }
	    mini = min(mini, sum / count);
	    maxi = max(maxi, sum / count);
	}
	res = max(res, maxi - mini);
    } else {
	for (int i = 1; rem-i >= k-m-1; i++) {
	    int comb = (1 << i) - 1;
	    while (comb < 1 << n) {
		if ((comb & bit) == 0) {
		    for (int j = 0; j < n; j++) {
			if ((comb>>j)&1)
			    as[j] = m;
		    }
		    calc(m+1, rem-i, bit | comb);
		}
		int x = comb & -comb, y = comb + x;
		comb = ((comb & ~y) / x >> 1) | y;
	    }
	}
    }
}

int main() {
    scanf("%d%d", &n, &k);
    for (int i = 0; i < n; i++) {
	scanf("%d", &ns[i]);
    }
    calc(0, n, 0);
    printf("%d\n", (int)ceil(res-eps));
}