#include<cstdio>
#include<algorithm>
using namespace std;
struct vect
{
	int indice,val;
};
bool comp(vect a,vect b)
{
	return b.val<a.val;
}
int main()
{
	freopen("loto.in","r",stdin);freopen("loto.out","w",stdout);
	vect v[20000];int s,i,n,t[20000],k=1,s2=0;bool val=1;
	scanf("%d%d",&n,&s);
	for(i=1;i<=n;i++)
		scanf("%d",&v[i].val),v[i].indice=i;
	sort(v+1,v+1+n,comp);
	for(;;)
	{
		for(i=k;i<=n;i++)
			t[i]=(s-s2)/v[i].val,s2+=t[i]*v[i].val;
		if(s==s2)
			break;
		if(t[n])
			s2-=v[n].val*t[n],t[n]=0;
		for(i=n;i>=1&&!t[i];i--);
		if(!i)
		{
			val=0;break;
		}
		t[i]--;k=i+1;s2-=v[i].val;
	}
	if(val)
	{
		for(i=1;i<=n;i++)
			v[v[i].indice].val=t[i];
		for(i=1;i<=n;i++)
			printf("%d ",v[i].val);
	}
	else
		printf("-1");
}