#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, K;
int v[NMAX], ans[7];

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

inline int binsearch(long long val){
    int st = 1, dr = K;
    int mid, last = 0;
    while(st <= dr){
        mid = (st + dr) / 2;
        if(sum[mid].val <= val){
            last = mid;
            st = mid + 1;
        } else dr = mid - 1;
    }
    if(sum[last].val == val)
        return last;
    else return 0;
}

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 = 1; j <= N; j++)
            for(int k = 1; k <= N; k++){
                sum[++K].val = v[i] + v[j] + v[k];
                sum[K].x = i; sum[K].y = j; sum[K].z = k;
            }
    sort(sum + 1, sum + K + 1, cmp);
    for(int i = 1; i <= K; i++){
        int pos = binsearch(S - sum[i].val);
        if(pos){
            ans[1] = sum[i].x; ans[2] = sum[i].y; ans[3] = sum[i].z;
            ans[4] = sum[pos].x; ans[5] = sum[pos].y; ans[6] = sum[pos].z;
            sort(ans + 1, ans + 7);
            for(int i = 1; i <= 6; i++)
                printf("%d ", ans[i]);
            return 0;
        }
    }
    printf("-1");

    return 0;
}