def ab(num):
    if num<0:
        num*=-1
    return num
B=int(input())
N=int(input())
C=[int(input()) for i in range(N)]
C.sort(reverse=True)
#print(C)
S=0
for i in range(N):
    S+=C[i]
S1=S+B
S1//=N
S//=N
mi=0
for i in range(N):
    mi+=ab(S-C[i])
i=C[0]
while i<=S1 and i>=C[0]:
    M=0
    j=0
    while B>0 and j<N:
        ma=ab(i-C[j])
   #     print(ma)
        B-=ma
        M+=ma
        j+=1
    if B<0:
        j-=1
        M+=B
        C[j]+=B
    while j<N:
        M+=ab(C[j]-i)
    if M<mi:
        mi=M
    i+=1
print(mi)