#include <bits/stdc++.h>

using namespace std;
const int NMAX = 110;

struct obj{
    long long val;
    int x, y, z;
}sum[NMAX * NMAX * NMAX];

int N, S, M;
int v[NMAX], ans[NMAX];

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

bool cmp(obj a, obj b){
    return a.val < b.val;
}

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 = k; k <= N; k++){
                M++;
                sum[M] = {v[i] + v[j] + v[k], i, j, k};
            }
    sort(sum + 1, sum + M + 1, cmp);
    int dr = M;
    for(int i = 1; i <= M; i++){
        while(sum[i].val + sum[dr].val > S && dr > 0)
            dr--;
        if(sum[i].val + sum[dr].val == S){
            printf("%d %d %d %d %d %d", v[sum[i].x], v[sum[i].y], v[sum[i].z], v[sum[dr].x], v[sum[dr].y], v[sum[dr].z]);
            return 0;
        }
    }
    printf("-1");

    return 0;
}