#include <cstdio>
#include <algorithm>

using namespace std;

FILE*f=fopen("loto.in","r");
FILE*h=fopen("loto.out","w");

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

struct val{
    int x;
};

struct val2{
    int a,b,c;
};

val c[1000001];

val2 c1[1000001];

bool sortez(val a,val b){
    return a.x<b.x;
}

int main()
{
    n=100;
    s=600000;
    fscanf(f,"%d%d",&n,&s);
    v[1]=100000;
    v[2]=100000;
    v[3]=100000;
    for ( int i=1;i<=n;++i )
        fscanf(f,"%d",&v[i]);
    for ( int i=1;i<=n;++i )
        for ( int j=1;j<=n;++j )
            for ( int r=1;r<=n;++r ){
                c[++k].x=v[i]+v[j]+v[r];
                c1[k].a=v[i];
                c1[k].b=v[j];
                c1[k].c=v[r];
            }
    sort(c+1,c+k+1,sortez);
    int p,pas;
    for ( int i=1;i<=k;++i ){
        p=0;
        for ( pas=1<<19;pas;pas/=2 )
            if ( p+pas<=k&&c[i].x+c[p+pas].x<=s )p+=pas;
        if ( c[i].x+c[p].x==s ){
            int s1,s2;
            for ( int i=1;i<=k;++i ){
                if ( c1[i].a+c1[i].b+c1[i].c==c[i].x )s1=i;
                if ( c1[i].a+c1[i].b+c1[i].c==c[p].x )s2=i;
            }
            fprintf(h,"%d %d %d %d %d %d",c1[s1].a,c1[s1].b,c1[s1].c,c1[s2].a,c1[s2].b,c1[s2].c);
            return 0;
        }
    }
    fprintf(h,"-1");
    return 0;
}