#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
#define rep(i,n) for(int i=0;i<(n);++i)
#define each(itr,c) for(__typeof(c.begin()) itr=c.begin(); itr!=c.end(); itr++)
#define mp make_pair
#define pb push_back
#define fi first
#define sc second

ll ab(ll p){
  return (p>0)?p:-p;
}

int main(int argc, char const *argv[]) {
  long b;
  int n;
  cin >>b >>n;

  std::vector<ll> c(n);
  ll sum=0;
  rep(i,n){
    cin >>c[i];
    sum += c[i];
  }


  ll ans=sum;
  long left=-1, right=(sum+b)/n+1;
  //printf("%ld %ld\n",left,right);
  ll tmp=0;
  rep(i,n) tmp+=ab(c[i]-right);
  ans=min(ans,tmp);

  bool end=false;
  while (right>left) {
    long xl=(left*2+right)/3;
    long xr=(left+right*2)/3;

    if(xr-xl<=1) end=true;

    //printf("xl:%ld, xr:%ld\n",xl,xr);

    ll tl=0, tr=0;
    rep(i,n) tl+=ab(c[i]-xl);
    rep(i,n) tr+=ab(c[i]-xr);
    /*
    cout << "tl = "<<tl;
    cout << "tr = "<<tr;
    cout << endl;
    */
    if(end){
      if(tl>tr) ans=min(ans,tr);
      else ans=min(ans,tl);
      break;
    }

    if(tl>=tr) left=xl;
    if(tl<=tr) right=xr;
  }

  std::cout << ans << std::endl;
  return 0;
}