# include <stdio.h>
long int a[1000],s,i,j,k,ok=0,n,m,z,l,q,max,aux,s1;
int main ()
{
freopen ("loto.in","r",stdin);
freopen ("loto.out","w",stdout);
scanf ("%li",&n);
scanf ("%li",&s);
for (i=0;i<n;i++)
scanf ("%li",&a[i]);
for (i=0;i<n-1;i++)
for (j=i+1;j<n;j++)
if (a[i]>a[j])
{
aux=a[i];
a[i]=a[j];
a[j]=aux;
}
q=0 ;
for (i=q;i<n;i++)
{if (ok==1) break;
for (j=i;j<n;j++)
{if (ok==1) break;
for (k=j;k<n;k++)
{if (ok==1) break;
for (l=k;l<n;l++)
{if (ok==1) break;
for (z=l;z<n;z++)
{if (ok==1) break;
for (m=z;m<n;m++)
{
s1=a[i]+a[j]+a[k]+a[l]+a[z]+a[m];
if (s1==s)
{
printf ("%li ",a[i]);
printf ("%li ",a[j]);
printf ("%li ",a[k]);
printf ("%li ",a[l]);
printf ("%li ",a[z]);
printf ("%li ",a[m]);
ok=1;
break;
}
if (s1-a[m]+a[n-1]<s)
m=n-1;
}
if (a[i]+a[j]+a[k]+a[l]+a[n-1]+a[n-1]<s)
z=n-1;
}
}
}
}
}
if (ok==0)
printf ("-1");
return 0;
}