#include <stdio.h>

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

int n, s;
int a[100];

struct sume
{
    int val;
    int nr1, nr2, nr3;
};

int main()
{
    fscanf(in, "%d %d", &n, &s);
    sume *v = new sume[n*n*n];

    for ( int i = 0; i < n; ++i )
        fscanf(in, "%d", &a[i]);

    int p = 0;
    for ( int i = 0; i < n; ++i )
        for ( int j = i; j < n; ++j )
            for ( int k = i; k < n; ++k )
            {
                v[p].val = a[i] + a[j] + a[k];
                v[p].nr1 = a[i];
                v[p].nr2 = a[j];
                v[p].nr3 = a[k];
                ++p;
            }

    for ( int i = 0; i < p - 1; ++i )
        for ( int j = i+1; j < p; ++j )
            if ( v[i].val > v[j].val )
            {
                sume t = v[i];
                v[i] = v[j];
                v[j] = t;
            }

    int sta = 0, sto = p-1;

    while ( sta <= sto )
    {
        int q = v[sto].val + v[sta].val;
        if ( q == s )
        {
            fprintf(out, "%d %d %d %d %d %d\n", v[sto].nr1, v[sto].nr2, v[sto].nr3,
                v[sta].nr1, v[sta].nr2, v[sta].nr3);

            return 0;
        }
        else if ( q < s )
            ++sta;
        else
            --sto;
    }

    fprintf(out, "%d\n", -1);

    return 0;
}