#include<iostream>
#include<algorithm>
using namespace std;
const int N = 100010;
long long n, m;
long long q[N];
int main()
{
	cin >> n >> m;
	for (int i = 0; i < n; i++)
	{
		cin >> q[i];
	}
	sort(q, q + n);
	long long cnt = 0;
	long long sum = 0;
	for (int i = 1; i < n-1; i++)
	{
		sum += q[i];
		cnt += q[n-1] - q[i];
	}
	if (cnt >= m)
		cout << sum + m;
	else
	{
		cout << sum + m - ((m - cnt)+(n-2)) / (n - 2);
	}
}