#include <iostream>
#include <cstdio>
#include <algorithm>
#define MAXN 110

using namespace std;

int a[MAXN], n, s, nq;
int part[MAXN*MAXN*MAXN];

void citire()
{
    scanf("%d %d\n", &n, &s);
    for (int i = 1; i <= n; i++)
        scanf("%d", &a[i]);
}

void solvePart()
{
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= n; j++)
            for (int k = 1; k <= n; k++)
                part[++nq] = a[i]+a[j]+a[k];
}

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

    citire();
    solvePart();
    int step = 1, val, must;
    sort(part+1, part+1+nq);

    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= n; j++)
            for (int k = 1; k <= n; k++) {
                int v = a[i] + a[j] + a[k];
                must = s-v;
                for (step = 1; step < nq; step <<= 1);
                for (val = 1; step; step >>= 1)
                    if (val + step <= nq && part[val+step] <= must)
                        val += step;
                if (part[val] != must) continue;
                for (int ii = 1; ii <= n; ii++)
                    for (int jj = 1; jj <= n; jj++)
                        for (int kk= 1; kk <= n; kk++)
                            if (a[ii] + a[jj] + a[kk] == must) {
                                printf("%d %d %d %d %d %d", i, j, k, ii, jj, kk);
                                return 0;
                            }
            }
    printf("-1");

    return 0;
}