#candi
def ab(num):
    if num<0:
        num*=-1
    return num
B=int(input())
N=int(input())
C=[int(i) for i in input().split()]
C.sort()
M=0
S=0
for j in range(N):
    S+=ab(C[0]-C[j])
i=1
M=S
while i <N:
    S=0
    for j in range(N):
        S+=ab(C[i]-C[j])
    if S<M:
        M=S
    j=i
    while j+1<N and C[j]==C[j+1]:
        j+=1
    i=j      
print(M)