#include 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> c(m, vector(n, i)) #define mat(type, c, m, n) vector> c(m, vector(n));for(auto& r:c)for(auto& i:r)cin>>i; #define rep(i,a,n) for(int i=(a), i##_len=(n); ii##_len; --i) #define each(x,y) for(auto &(x):(y)) #define var(type, ...)type __VA_ARGS__;Scan(__VA_ARGS__); template void Scan(T& t) { cin >> t; } templatevoid Scan(First& first, Rest&...rest) { cin >> first; Scan(rest...); } #define vec(type, c, n) vector 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(a) typedef long long ll; typedef long double ld; typedef vector vi; typedef vector vd; typedef vector vll; typedef vector vs; typedef vector vb; typedef pair pii; #define mini min_element #define maxi max_element #define sum(a, b) accumulate(a, b) #define chmax(a,b) if(ab)a=b template inline void print(T t){cout << t << "\n";} template inline void print(H h, T... t){cout << h << " ";print(t...);} unordered_map m; ll f(vll& v, ll& avg) { if (m[avg] == 0) each(a, v) m[avg] += abs(a - avg); return m[avg]; } ll solve() { var(ll, b, n); vec(ll, c, n); if (len(set(all(c))) == 1) return 0; ll max_b = (b + sum(all(c), 0LL)) / n; ll low = *mini(all(c)), high = max_b, m1 = 1, m2 = max_b - 1; while (low + 3 < high) { m1 = (low * 2 + high) / 3; m2 = (low + high * 2) / 3; if (f(c, m1) < f(c, m2)) { high = m2; } else { low = m1; } } return min({f(c, low), f(c, m1), f(c, m2), f(c, high)}); } int main() { print(solve()); return 0; }