#include <bits/stdc++.h>
#define int long long
using namespace std;
int n, m, a[50], l = 0, r = 1e12, mid, ans;
bool check(int x)
{
	int s = 0;
	for (int i = 1; i <= n; i++) s += max(x - a[i], 0ll);
	return s <= m && s <= x;
}
signed main()
{
	cin >> n >> m;
	for (int i = 1; i <= n; i++) cin >> a[i];
	while (l <= r)
	{
		mid = (l + r) / 2;
		if (check(mid)) ans = mid, l = mid + 1;
		else r = mid - 1;
	}
	cout << ans;
	return 0;
}