#include <stdio.h>
#include <unordered_map>
using namespace std;

const int Nmax = 101;
const int Smax = 6 * 1e8 + 5;

struct _3tuple {
    int a, b, c;
    
    _3tuple() {}
    _3tuple(int x, int y, int z) :
        a(x), b(y), c(z) {}
};


int n, s;
int v[Nmax];
unordered_map<int, _3tuple> m;

int main() {
    freopen("loto.in", "r", stdin);
    freopen("loto.out", "w", stdout);
    int sp;
    unordered_map<int, _3tuple>::iterator it;

    scanf("%d %d", &n, &s);
    for (int i = 1; i <= n; ++i)
        scanf("%d", &v[i]);

    for (int i = 1; i <= n; ++i)
        for (int j = 1; j <= n; ++j)
            for (int k = 1; k <= n; ++k) {
                sp = v[i] + v[j] + v[k];
                if (sp <= Smax) {
                    m[sp] = _3tuple(v[i], v[j], v[k]);
                    it = m.find(s - sp);
                    if (it != m.end()) {
                        printf("%d %d %d %d %d %d\n", v[i], v[j], v[k], it->second.a, it->second.b, it->second.c);
                        return 0;
                    }
                }
            }
    printf("-1\n");
    return 0;
}