#include <iostream>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <cstdio>
using namespace std;
int main()
{
	freopen ("eko.in","r",stdin);
	freopen ("eko.out","w",stdout);
	int n,m;
	cin>>n>>m;
	int num[n+1];
	for(int i=1;i<=n;i++)
		cin>>num[i];
	sort(num+1,num+(n+1));
	for(int i=num[n];i>=0;i--)
	{
		int nn=0;
		for(int j=n;j>=1;j--)
		{
			if(i>num[j])
				break;
			nn=nn+(num[j]-i);
		}
		if(m<nn)
		{
			cout<<i;
			break;
		}
		if(m==nn)
		{
			cout<<i;
			break;
		}
	}
	return 0;
}