#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cmath>
using namespace std;

typedef unsigned long long ll;

ll A[1145141];

int main() {
    ll n, m;
    cin >> n >> m;
    for (ll i = 1; i <= n; i++) {
        cin >> A[i];
    }
    ll sum = 0;
    sort(A + 1, A + 1 + n);
    ll p = 0;
    for (ll i = 2; i <= n - 1; i++) {
        sum += (A[n] - A[i]);
        p += A[i];
    }
    if (sum >= m) {
        cout << m + p;
    } else {
        m = m - sum;
        ll t = m / (n - 1) * (n - 2), w = m % (n - 1);
        // if (w != 0) {
        //     t += w - 1;
        // }
        cout << t + p;
    }
    return 0;
}