#include <stdio.h>

int A[101],S;
char sol[7],n,ok=1;

bool valid(int p)
{
if (p>1) if (A[sol[p-1]]>A[sol[p-1]]) return 0;
return 1;
}

void solv(int p)
{
for (char i=1;i<=n && ok;i++)
{
sol[p] = i;
if (valid(p)) if (p==6) if (sol[1]+sol[2]+sol[3]+sol[4]+sol[5]+sol[6]==S) ok=0;
                        else;
              else solv(p+1);
}
}

int main()
{
FILE *in = fopen("loto.in","r");
FILE *out = fopen("loto.out","w");


fscanf(in,"%d %d",&n,&S);
int i;
for (i=1;i<=n;i++)
fscanf(in,"%d",&A[i]);

solv(1);
if (ok==0) for (i=1;i<=6;i++) fprintf(out,"%d ",A[sol[i]]);
else fprintf(out,"-1");
}