#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
#include <functional>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r,v) auto r = (v)
#else
#define aut(r,v) __typeof(v) r = (v)
#endif
#define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it)
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset(m,v,sizeof(m))
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
using namespace std;
typedef vector<int> vi; typedef pair<int,int> pii; typedef vector<pair<int,int> > vpii; typedef long long ll;
template<typename T, typename U> inline void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> inline void amax(T &x, U y) { if(x < y) x = y; }

int main() {
	int B;
	cin >> B;
	int N;
	cin >> N;
	vector<int> C(N);
	rep(i, N)
		cin >> C[i];
	//min. \sum_i |C[i] - X|
	//\sum_i max(0, C[i] - X) + B >= \sum_i max(0, X - C[i])
	sort(all(C));
	long long ans = INFL;
	vector<ll> candidates;
	rep(i, 1 << N) {
		ll sum = 0;
		rep(j, N) if(i >> j & 1)
			sum += C[j];
		rer(j,-N,N)rer(t,1,N+1)rer(d,-2,2) {
			candidates.push_back(sum+(ll)B*j+d);
			candidates.push_back((sum+(ll)B*j)/t+d);
		}
	}
	each(xi, candidates) {
		ll X = *xi;
		if(X<0)continue;
		ll a = 0, b = 0, c = 0;
		rep(i, N) {
			a += max(0LL, X - C[i]);
			b += max(0LL, C[i] - X);
			c += abs(X - C[i]);
		}
		if(a <= b + B)
			amin(ans, c);
	}
	cout << ans << endl;
	return 0;
}