#include <stdio.h>
#include <stdlib.h>
#include <map>
#include <tr1/unordered_map>

typedef struct header_data {
    int n;
    int s;
} header_data;

typedef struct three_sum {
    int v[3];
    int sum;
} three_sum;

header_data readHeader (FILE* in) {
    header_data h;
    fscanf(in, "%d %d", &(h.n), &(h.s));
    return h;
}

void readNumbers (int* v, int n, FILE* in) {
    int i;
    for (i = 0; i < n; i++) {
        fscanf(in, "%d ", &v[i]);
    }
}

int solve (int* v, int n, std::tr1::unordered_map<int, three_sum> map, int desiredSum, int* result) {
    int i, j, k, m = 0;
    three_sum t;
    for (i = 0; i < n; i++) {
        for (j = 0; j < n; j++) {
            for (k = 0; k < n; k++) {
                t.v[0] = v[i];
                t.v[1] = v[j];
                t.v[2] = v[k];
                t.sum = v[i] + v[j] + v[k];
                if (map.find(desiredSum - t.sum) != map.end()) {
                    // key exists
                    three_sum f = map[desiredSum - t.sum];
                    result[0] = f.v[0];
                    result[1] = f.v[1];
                    result[2] = f.v[2];
                    result[3] = t.v[0];
                    result[4] = t.v[1];
                    result[5] = t.v[2];
                    return 1;
                }
                else {
                    map[t.sum] = t;
                }
            }
        }
    }
    return 0;
}

int printResult (int* result, int exists, FILE* out) {
    if (exists) {
        int i;
        for (i = 0; i < 6; i++) {
            fprintf(out, "%d ", result[i]);
        }
    }
    else {
        fprintf(out, "%d", -1);
    }
}

int cmpfunc (const void * a, const void * b) {
   return ( (*(three_sum*)a).sum - (*(three_sum*)b).sum );
}

int main () {

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


    header_data h = readHeader(in);
    int n = h.n;
    int s = h.s;

    int v[n];
    readNumbers(v, n, in);

    int result[6];
    std::tr1::unordered_map<int, three_sum> map;
    int exists = solve(v, n, map, s, result);

    printResult(result, exists, out);

    return 0;

}