#include <cstdio>
#include <algorithm>
using namespace std;
#define MAXN 101

FILE *in=fopen("loto.in","r"),*out=fopen("loto.out","w");
int N,S,V[MAXN];

void citesteDate()
{
    int i;
    fscanf(in,"%d %d",&N,&S);
    for (i=1;i<=N;i++)
        fscanf(in,"%d",&V[i]);
    fclose(in);
}

void proceseaza()
{
    int i,j,k,l,m,n;
    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 (n=1;n<=N;n++)
                            if (V[i]+V[j]+V[k]+V[l]+V[m]+V[n]==S)
                            {
                                fprintf(out,"%d %d %d %d %d %d\n",V[i],V[j],V[k],V[l],V[m],V[n]);
                                fclose(out);
                                return;
                            }
    fprintf(out,"-1\n");
    fclose(out);
}





int main()
{
    sort(V+1,V+N+1);
    citesteDate();
    proceseaza();
    return 0;
}