#include <cstdio>
#include <algorithm>

using namespace std;

#define FILEIN "loto.in"
#define FILEOUT "loto.out"
#define NMAX 101

int N, V[NMAX], S;

struct Half {
    int Value;
    int Nr[3];
};

Half Sums[NMAX*NMAX*NMAX];

inline bool SumCompare(const Half& A, const Half& B) {
    return A.Value < B.Value;
}

int main() {
    freopen(FILEIN, "r", stdin);
    freopen(FILEOUT, "w", stdout);

    scanf("%d %d", &N, &S);
    for ( int i = 1; i <= N; i++ ) {
        scanf("%d", &V[i]);
    }

    int SumCounter = 0;
    for ( int i = 1; i <= N; i++ ) {
        for ( int j = 1; j <= N; j++ ) {
            for ( int k = 1; k <= N; k++ ) {
                Half Add;
                Add.Value = V[i] + V[j] + V[k];
                Add.Nr[0] = V[i], Add.Nr[1] = V[j], Add.Nr[2] = V[k];

                Sums[++SumCounter] = Add;
            }
        }
    }

    sort(Sums+1, Sums+SumCounter+1, SumCompare);

    for ( int i = 1; i <= N; i++ ) {
        for ( int j = 1; j <= N; j++ ) {
            for ( int k = 1; k <= N; k++ ) {
                Half Search;
                Search.Value = S - (V[i] + V[j] + V[k]);
                Half *SumPtr = lower_bound(Sums+1, Sums+SumCounter+1, Search, SumCompare);
                if (SumPtr->Value == (S - (V[i] + V[j] + V[k]))) {
                    printf("%d %d %d %d %d %d\n", V[i], V[j], V[k], SumPtr->Nr[0], SumPtr->Nr[1], SumPtr->Nr[2]);
                    return 0;
                }
            }
        }
    }

    printf("-1\n");


    return 0;
}