#include <cstdio>
#include<algorithm>
FILE *f=fopen("loto.in","r");
FILE *g=fopen("loto.out","w");

using namespace std;

struct sume
{
    long long a,b,c,sum;
};

long long i,n,s,v[101],j,k,nr,poz,ok;
sume x[10000001];

int compare(sume x1,sume x2)
{
    return (x1.sum<x2.sum);
}
int compara (sume x1,long long t)
{
    return (x1.sum<=t);
}
int main()
{
    fscanf(f,"%lld %lld",&n,&s);
    for (i=1;i<=n;i++)
        fscanf(f,"%lld",&v[i]);

    nr=0;
    for (i=1;i<=n;i++)
        for (j=i;j<=n;j++)
            for (k=j;k<=n;k++)
                {
                    nr++;
                    x[nr].a=i;
                    x[nr].b=j;
                    x[nr].c=k;
                    x[nr].sum=i+j+k;
                }

    sort(x+1,x+nr+1,compare);

    //for (i=1;i<=nr;i++)        fprintf(g,"%d ",x[i].sum);
    //fprintf(g,"\n");

    ok=-1;

    for (i=1;i<=nr;i++)
    {
        //poz=det(s-x[i].sum);
        //fprintf(g,"%d ",s-x[i].sum);
        poz=lower_bound(x+1,x+nr+1,s-x[i].sum,compara)-x-1;
       //fprintf(g,"%d\n",poz);
        if (x[poz].sum==s-x[i].sum)
        {
            fprintf(g,"%lld %lld %lld %lld %lld %lld",x[i].a,x[i].b,x[i].c,x[poz].a,x[poz].b,x[poz].c);
            ok=1;
            break;
        }
    }
    if (ok==-1) fprintf(g,"%lld",ok);

    fclose(f);
    fclose(g);
}