// Standard I/O #include #include #include // Standard Library #include #include #include #include // Template Class #include #include #include #include #include #include #include #include // Container Control #include using namespace std; #define rep( i, n ) for( int i = 0; i < n; ++i ) #define irep( i, n ) for( int i = n-1; i >= 0; --i ) #define reep( i, s, n ) for ( int i = s; i < n; ++i ) #define ireep( i, n, s ) for ( int i = n-1; i >= s; --i ) #define foreach(itr, x) for( typeof(x.begin()) itr = x.begin(); itr != x.end(); ++itr) #define mp( a, b ) make_pair( a, b ) #define pb( a ) push_back( a ) #define all( v ) v.begin(), v.end() #define fs first #define sc second #define vc vector // for visualizer.html double SCALE = 1.0; double OFFSET_X = 0.0; double OFFSET_Y = 0.0; #define LINE(x,y,a,b) cerr << "line(" << SCALE*(x) + OFFSET_X << "," \ << SCALE*(y) + OFFSET_Y << "," \ << SCALE*(a) + OFFSET_X << "," \ << SCALE*(b) + OFFSET_Y << ")" << endl; #define CIRCLE(x,y,r) cerr << "circle(" << SCALE*(x) + OFFSET_X << "," \ << SCALE*(y) + OFFSET_Y << "," \ << SCALE*(r) << ")" << endl; typedef long long ll; typedef complex Point; typedef pair pii; typedef pair ipii; typedef vector vi; typedef vector vd; typedef vector< vector > vii; typedef vector< vector > vdd; typedef vector::iterator vi_itr; const int IINF = 1 << 28; const double INF = 1e30; const double EPS = 1e-10; const double PI = acos(-1.0); // Direction : L U R D const int dx[] = { -1, 0, 1, 0}; const int dy[] = { 0, -1, 0, 1 }; ll N, B, A[10]; ll solve( ll ave ) { ll ans = 0; rep(i, N){ if( A[i] > ave ){ B += A[i] - ave; ans += A[i] - ave; } else{ B -= ave - A[i]; ans += ave - A[i]; } } return ans; } int main() { cin >> B >> N; rep(i, N) cin >> A[i]; sort( A, A+N, greater() ); ll sum = 0; rep(i, N) sum += A[i]; cout << min(solve(sum/N), solve((sum+B)/N)) << endl; }