package test;
import java.math.BigInteger;
import java.util.Arrays;
import java.util.Scanner;
import jdk.internal.dynalink.beans.StaticClass;
//now
public class c {
static int mm;
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while(sc.hasNext()) {
int n = sc.nextInt();
int m = sc.nextInt();
int a[]=new int[n];
for(int i=0;i<a.length;i++) {
a[i]=sc.nextInt();
mm+=a[i];
}
int b[]=new int[m];
f(a,b,0,n,m);
System.out.println(mm);
}
}
public static void f(int []a,int []b,int k,int n,int m) {
if(k<n) {
for(int i=0;i<m;i++) {
b[i]+=a[k];
f(a, b, k+1, n, m);
b[i]-=a[k];
}
}else {
int max=b[0];
int min=b[0];
for(int i=0;i<m;i++) {
if(b[i]>max)max=b[i];
if(b[i]<min)min=b[i];
}
if(max-min<mm)mm=max-min;
}
}
}