#include<stdio.h>
#include<algorithm>
using namespace std;

int v[101];

int main()
{
    freopen("loto.in","r",stdin);
    freopen("loto.out","w",stdout);
    int n,s,i1,i2,i3,i4,i5,i6;
    scanf("%d%d",&n,&s);
    for(i1=1;i1<=n;++i1)
        scanf("%d",&v[i1]);
    sort(v+1,v+1+n);

    for(i1=1;i1<=n;++i1)
        for(i2=1;i2<=n;++i2)
            for(i3=1;i3<=n;++i3)
                for(i4=1;i4<=n;++i4)
                    for(i5=1;i5<=n;++i5)
                        for(i6=1;i6<=n;++i6)
                            if(v[i1]+v[i2]+v[i3]+v[i4]+v[i5]+v[i6]==s)
                            {
                                printf("%d %d %d %d %d %d\n",v[i1],v[i2],v[i3],v[i4],v[i5],v[i6]);
                                return 0;
                            }
    printf("-1\n");
    return 0;
}