#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
int m,n,a[1000001],ans=0,k=1,high;
using namespace std;
int cop(int a,int b)
{
	return a>b;
}
int main()
{
	freopen("eko.in","r",stdin);
    freopen("eko.out","w",stdout);
	while(cin>>n>>m)
	{
	for(int i=0;i<n;i++)
		cin>>a[i];
	sort(a,a+n,cop);
	for(int i=0;i<n-1;i++)
	{
		ans=ans+(a[i]-a[i+1])*k;
		k++;
		if(ans>=m)
		{
			break;
		high=a[i+1]+(ans-m)/k;
	    cout<<high<<endl;
		}
	} 
	}
    return 0;
}