#include <cstdio>
#include <algorithm>

using namespace std;

const int NMax = 102, SMax = 600000000;

int N, S;
int a[NMax];
int nv;
int v[1000003];

int main()
{
    freopen("loto.in", "r", stdin);
    scanf("%d %d", &N, &S);
    for (int i = 1; i <= N; ++ i)
        scanf("%d", &a[i]);
    register int i, j, k;
    for (i = 1; i <= N; ++ i)
        for (j = 1; j <= N; ++ j)
            for (k = 1; k <= N; ++ k)
                v[++nv] = a[i] + a[j] + a[k];
    sort(v+1, v+nv+1);
    int ns, st, dr, mij;
    for (int ii = 1; ii <= nv; ++ ii)
    {
        ns = S - v[ii];
        st = 1, dr = nv;
        while (st <= dr)
        {
            mij = (st+dr) >> 1;
            if (v[mij] == ns)
            {
                freopen("loto.out", "w", stdout);
                for (i = 1; i <= N; ++ i)
                    for (j = 1; j <= N; ++ j)
                        for (k = 1; k <= N; ++ k)
                        {
                            if (a[i] + a[j] + a[k] == v[ii])
                            {
                                v[ii] = 600000005;
                                printf("%d %d %d ", i, j, k);
                            }
                            if (a[i] + a[j] + a[k] == ns)
                            {
                                ns = 600000005;
                                printf("%d %d %d ", i, j, k);
                            }
                            if (v[ii] == 600000005 && ns == 600000005)
                            {
                                printf("\n");
                                return 0;
                            }
                        }
                return 0;
            }
            else if (v[mij] < ns)
                st = mij + 1;
            else
                dr = mij - 1;
        }
    }
    freopen("loto.out", "w", stdout);
    scanf("-1\n");
    return 0;
}