#include <bits/stdc++.h>
using namespace std;
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define vv(type, c, m, n, i) vector<vector<type>> c(m, vector<type>(n, i))
#define mat(type, c, m, n) vector<vector<type>> c(m, vector<type>(n));for(auto& r:c)for(auto& i:r)cin>>i;
#define rep(i,a,n) for(int i=(a), i##_len=(n); i<i##_len; ++i)
#define rrep(i,a,n) for(int i=(a), i##_len=(n); i>i##_len; --i)
#define each(x,y) for(auto &(x):(y))
#define var(type, ...)type __VA_ARGS__;Scan(__VA_ARGS__);
template<typename T> void Scan(T& t) { cin >> t; }
template<typename First, typename...Rest>void Scan(First& first, Rest&...rest) { cin >> first; Scan(rest...); }
#define vec(type, c, n) vector<type> c(n);for(auto& i:c) cin>>i;
#define len(x) ((int)(x).size())
#define mp make_pair
#define eb emplace_back
#define em emplace
#define pb pop_back
#define fi first
#define se second
#define get(a, i) get<i>(a)
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<long long> vll;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef pair<int, int> pii;
#define mini min_element
#define maxi max_element
#define sum(a, b) accumulate(a, b)
#define chmax(a,b) if(a<b)a=b
#define chmin(a,b) if(a>b)a=b
template <class T> inline void print(T t){cout << t << "\n";}
template <class H, class... T> inline void print(H h, T... t){cout << h << " ";print(t...);}
ll f(vll v, ll avg) {
	ll ans = 0;
	each(a, v) {
		ans += abs(a - avg);
	}
	return ans;
}
ll solve() {
	var(ll, b, n);
	vec(ll, c, n);
	sort(rall(c));
	if (len(set<ll>(all(c))) == 1)
		return 0;
	ll max_b = (b + sum(all(c), 0LL)) / n;
	ll low = 0, high = max_b, mid = 0;
	map<ll, ll> m;
	m[low] = sum(all(c), 0LL);
	m[high] = f(c, max_b);
	while (low + 1 < high) {
		mid = (low + high) / 2;
		m[mid] = f(c, mid);
		if (m[low] < m[high]) {
			high = mid;
		} else {
			low = mid;
		}
	}
	return m[low] < m[high] ? m[low] : m[high];
}
int main() {
	print(solve());
	return 0;
}