#include <bits/stdc++.h>

using namespace std;
const int NMAX = 110;

int N, S, M;
int v[NMAX], ans[NMAX];
unordered_map <int, pair <int, pair <int, int> > > hmap;

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

int main(){

    freopen("loto.in", "r", stdin);
    freopen("loto.out", "w", stdout);

    read();

    for(int i = 1; i <= N; i++)
        for(int j = i; j <= N; j++)
            for(int k = j; k <= N; k++)
                hmap[v[i] + v[j] + v[k]] = make_pair(i, make_pair(j, k));
    for(int i = 1; i <= N; i++)
        for(int j = i; j <= N; j++)
            for(int k = j; k <= N; k++){
                int suma = v[i] + v[j] + v[k];
                if(hmap.count(S - suma)){
                    printf("%d %d %d %d %d %d", v[i], v[j], v[k], v[hmap[S - suma].first], v[hmap[S - suma].second.first], v[hmap[S - suma].second.second]);
                    return 0;
                }
            }
    printf("-1");
    return 0;
}