Problem statement

The spellbook you have contains $ N $ of spells.

Magic is numbered from $ 1 $ to $ N $, and the cost of magic $ i (1 \ le i \ le N) $ is initially an integer $ A_i $.

Your goal is to cast all the spells in the spellbook $ 1 $ each.

You can eat $ K $ of cookies before you start casting magic. It doesn't take long to eat cookies.

For every $ 1 $ you eat a cookie, you can choose a magic with a positive cost of $ 1 $ and reduce that cost by $ 1 $.

After eating the cookie, you start casting magic.

Your MP is initially $ M $. You repeat either of the following to cast $ N $ of magic $ 1 $ in any order.

* Choose an integer $ i (1 \ le i \ le N) $ for $ 1 $ and cast the magical $ i $. However, the current MP must cost more than the magical $ i $.
* Time does not elapse.
* Consume MP for the cost of magical $ i $.
* Rest. However, if the current MP is $ m $, then $ m <M $ must be.
* Time elapses $ M --m $.
* Recover $ 1 $ MP.



Find the minimum amount of time it will take you to cast $ N $ of spells $ 1 $ each in any order.

Constraint

* $ 1 \ leq N \ leq 10 ^ 5 $
* $ 1 \ leq M \ leq 10 ^ 6 $
* $ 0 \ leq K \ leq \ sum_ {i = 1} ^ {N} A_i $
* $ 1 \ leq A_i \ leq M $
* All inputs are integers.



* * *

input

Input is given from standard input in the following format.


$ N $ $ M $ $ K $
$ A_1 $ $ A_2 $ $ \ ldots $ $ A_N $


output

Print the minimum amount of time it takes to cast $ N $ of magic $ 1 $ each.

* * *

Input example 1


2 4 0
twenty four


Output example 1


3


Since the cost of any magic cannot be reduced, I will continue to cast magic as it is.

* First, cast the magic $ 1 $. It consumes $ 2 $ of MP, so the remaining MP is $ 4-2 = 2 $.



You cannot cast magic $ 2 $ as it is because you need $ 4 $ MP to cast magic $ 2 $.

* I'll take a rest. Time elapses $ 4-2 = 2 $ seconds. It recovers $ 1 $ of MP, so the remaining MP is $ 2 + 1 = 3 $.
* I'll take a rest. Time elapses $ 4-3 = 1 $ seconds. It recovers $ 1 $ of MP, so the remaining MP is $ 3 + 1 = 4 $.
* Cast magic $ 2 $. It consumes $ 4 $ of MP, so the remaining MP is $ 4-4 = 0 $.



From the above, if the time is $ 2 + 1 = 3 $ seconds, the magic $ 1,2 $ can be cast $ 1 $ each time. You can't cast all the spells in less time, so the answer you're looking for is $ 3 $.

* * *

Input example 2


3 9 6
2 3 9


Output example 2


0


With a final magic cost of $ 2, 2, 4 $, you can cast all the magic without a break.

* * *

Input example 3


3 16 2
6 9 9


Output example 3


twenty one


* * *

Input example 4


2 1000000 0
1000000 1000000


Output example 4


500000500000


The answer may not fit in the range that can be represented by a 32-bit integer.





Example

Input

2 4 0
2 4


Output

3
#include <bits/stdc++.h>
using namespace std;
/*#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<typename T> using gpp_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename L> using gpp_map = tree<T, L, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T> using gpp_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;*/
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)
#define REP(i, n) FOR(i,0,n)
#define IFOR(i, begin, end) for(int i=(end)-1;i>=(begin);i--)
#define IREP(i, n) IFOR(i,0,n)
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#define all(v) v.begin(),v.end()
#define SZ(v) ((int)v.size())
#define Lower_bound(v, x) distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) distance(v.begin(), upper_bound(v.begin(), v.end(), x))
#define Max(a, b) a = max(a, b)
#define Min(a, b) a = min(a, b)
#define bit(n) (1LL<<(n))
#define bit_exist(x, n) ((x >> n) & 1)
#define debug(x) cout << #x << "=" << x << endl;
#define vdebug(v) { cout << #v << "=" << endl; REP(i_debug, v.size()){ cout << v[i_debug] << ","; } cout << endl; }
#define mdebug(m) { cout << #m << "=" << endl; REP(i_debug, m.size()){ REP(j_debug, m[i_debug].size()){ cout << m[i_debug][j_debug] << ","; } cout << endl;} }
#define Return(ans) { cout << (ans) << endl; return 0; }
#define pb push_back
#define f first
#define s second
#define int long long
#define INF 1000000000000000000
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for (auto &x : v) is >> x; return is; }
template<typename T> ostream &operator<<(ostream &os, vector<T> &v){ for(int i = 0; i < v.size(); i++) { cout << v[i]; if(i != v.size() - 1) cout << endl; }; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, pair<T1, T2> p){ cout << '(' << p.first << ',' << p.second << ')'; return os; }
template<typename T> void Out(T x) { cout << x << endl; }
template<typename T1, typename T2> void Ans(bool f, T1 y, T2 n) { if(f) Out(y); else Out(n); }

using vec = vector<int>;
using mat = vector<vec>;
using Pii = pair<int, int>;
using PiP = pair<int, Pii>;
using PPi = pair<Pii, int>;
using bools = vector<bool>;
using pairs = vector<Pii>;

//int dx[4] = {1,0,-1,0};
//int dy[4] = {0,1,0,-1};
//char d[4] = {'D','R','U','L'};

const int mod = 1000000007;
//const int mod = 998244353;
//#define Add(x, y) x = (x + (y)) % mod
//#define Mult(x, y) x = (x * (y)) % mod

int solve(vec A, int N, int M, int K, int r){

    int x0 = 0, x1 = M;
    while(x1 - x0 > 1){
        int x = (x0 + x1) / 2;
        int cnt = 0;
        REP(i, N) if(A[i] > x) cnt += A[i] - x;

        if(cnt <= K) x1 = x;
        else x0 = x;
    }

    int cnt = 0;
    REP(i, N) if(A[i] > x1){
        cnt += A[i] - x1;
        A[i] = x1;
    }
    REP(i, N) if(A[i] == A[N - 1] && cnt < K){
        cnt++;
        A[i]--;
    }

    if(A[N - 1] < r) return INF;

    int t = 0;
    REP(i, N) t += A[i] * (A[i] + 1) / 2;
    t -= r * (r + 1) / 2;

    return t;
}

signed main(){

    int N, M, K; cin >> N >> M >> K;
    vec A(N); cin >> A;
    Sort(A);

    int s = 0; REP(i, N) s += A[i];
    if(s - K <= M){
        Out(0);
        return 0;
    }

    int n = 0, r = M;
    while(A[N - 1 - n] <= r){
        r -= A[N - 1 - n];
        n++;
    }

    int ans = INF;
    Min(ans, solve(A, N - n, M, K, r));

    if(A[N - 1 - n] - r <= K){
        Min(ans, solve(A, N - n - 1, M, K - (A[N - 1 - n] - r), 0));
    }
    Out(ans);

    return 0;
}

