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