#include <cstdlib>
#include <cstdio>
#include <ctime>


long long s;
int n,v[101];

void swap(int *a,int *b)
{
     int aux = *a;
     *a = *b;
     *b = aux;
}
int caut_piv(int v[],int l,int r)
{
    int m = r;
    
    l--;
    
        
    while ( l<r && v[++l]<v[m] );
    while ( l<r && v[--r]>v[m] );
    
    if ( l<r )
             swap(&v[l],&v[r]);
    swap (&v[l],&v[r]);
    return l;
}
          
          
void qsort(int v[],int l,int r)
{
     if ( l>=r )        return;
     int m = caut_piv(v,l,r);
     qsort(v,l,m-1);
     qsort(v,m+1,r);
}


int main()
{
    FILE *f,*g;
    f = fopen("loto.in","r");
    g = fopen("loto.out","w");
    
    fscanf(f,"%d %lld",&n,&s);
    for (int i = 1 ; i <= n; i++)
        fscanf(f,"%d",&v[i]);
    
    fclose(f);
    
    clock_t start,finish;
    start = clock();
    qsort(v,1,n);
    finish = clock();
    for (int i = 1 ; i <= n; i++)
        printf("%d ",v[i]);
    printf("\nqsort durat:%.3f\n",(finish-start)/CLOCKS_PER_SEC);
    
    long long a,b,c,d,e,af;
    int ok = 0;
    
    for ( a = 1; a <= n; a++)
        for ( b = a; b <= n; b++)
            for ( c = b; c <= n; c++)
                for ( d = c; d <= n; d++)
                    for ( e = d; e <= n; e++)
                        for ( af = e; af <= n ; af++)
                        if (v[af]+v[a]+v[b]+v[c]+v[d]+v[e] == s)
                        {
                                                         ok = 1;
                                                         goto exit;
                        }
            
        exit:
         if ( ok )         printf("%d %d %d %d %d %d\n",v[a],v[b],v[c],v[d],v[e],v[af]);
            else printf("-1\n");
    
    system("pause"); 
    fclose(g);         
    return 0;
}