#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
int main()
{
	freopen("eko.in","r",stdin);
	freopen("eko.out","w",stdout);
	int n,m,a[100001],t[100001],k,s;
	cin>>n>>m;
	for(int i=0;i<n;i++)
		cin>>a[i];
	sort(a+0,a+n);
	for(int i=0;i<n;i++)
		for(int j=i;j<n;j++)
			t[i]+=a[j]-a[i];
	//cout<<k;
	for(int q=n-1;q>=0;q--)
	{
		if(t[q]>=m)
		{
			k=q;
			break;
		}
		//cout<<s1;
	}
	for(int i=t[k];i>=t[k-1];i--)
	{
		s=t[k];
		if(s==m)
		{
			cout<<s;
			break;
		}
		s++;
	}
	cout<<a[n-1]-1;
	return 0;
}