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

int main()
{
    long int n,s,a[101],b[7],i,j,t,k=0;
    FILE *r;
    r=fopen("loto.in","r");
    fscanf(r,"%ld %ld",&n,&s);
    for (i=1;i<=n;i++)
        fscanf(r,"%ld",&a[i]);
    sort(a+1,a+n+1);
    fclose(r);
    r=fopen("loto.out","w");
    j=n;
    if (s<a[1])
    {
        fprintf(r,"-1");
        t=1;
    }
    for (i=1;i<=6;i++)
    {

        s=s-a[j];

        if ((s>0)||((s==0)&&(i==6)))
        {
            b[i]=a[j];
            k=j;
        }

        if ((s<0)||((s==0)&&(i!=6)))
        {
            s=s+a[j];
            j--;
            i--;
        }

        if (j==0)
        {
            s=s+b[i];
            i--;
            j=k-1;
        }

    }
    if (s>0)
        {
            fprintf(r,"-1");
            t=1;
        }
    if (t==0)
        for (i=1;i<=6;i++)
            fprintf(r,"%ld ",b[i]);
    fclose(r);
return 0;
}