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

FILE *f,*g;
int v[100001],s,i,j,k,l,m,n,o;

void procesare(){
    for(i=1;i<=n;i++)
        for(j=1;j<=n;j++)
            for(k=1;k<=n;k++)
                for(l=1;l<=n;l++)
                    for(m=1;m<=n;m++)
                        for(o=1;o<=n;o++){
                            if(v[i]+v[j]+v[k]+v[l]+v[m]+v[o]==s){
                                fprintf(g,"%d %d %d %d %d %d\n",v[i],v[j],v[k],v[l],v[m],v[o]);
                                return;
                            }
                        }
    fprintf(g,"-1\n");
}

int main()
{
    f=fopen("loto.in","r");
    g=fopen("loto.out","w");
    fscanf(f,"%d%d",&n,&s);
    for(i=1;i<=n;i++){
        fscanf(f,"%d",&v[i]);
    }
    procesare();
    fclose(f);
    fclose(g);
    return 0;
}