#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
#include <iomanip>
#include <map>
#include <numeric>
using namespace std;
typedef long long LL;

int main(){
    LL B, N;
    cin >> B >> N;
    vector<LL> C(N);
    for(int i = 0; i < N; i++){
        cin >> C[i];
    }
    LL ans = accumulate(C.begin(), C.end(), 0);

    for(int i = 0; i < N; i++){
        LL target = C[i];
        LL short_cnt = 0;
        LL over_cnt = 0;
        for(int j = 0; j < N; j++){
            if(C[j] - target < 0){
                short_cnt += -(C[j] - target);
            }else{
                over_cnt += C[j] - target;
            }
        }
        if(short_cnt <= over_cnt + B){
            ans = min(ans, short_cnt + over_cnt);
        }
    }

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