#include<cstdio>
#include<queue>
#include<map>
using namespace std;
FILE*in=fopen("loto.in","r");
FILE*out=fopen("loto.out","w");
int n,s,i,j,k,v[103];
struct ras
{
    int a,b,c;
    bool x;
};
ras mem;
map<int,ras> m;
int main()
{
    fscanf(in,"%d%d",&n,&s);
    for(i=1;i<=n;i++)
    {
        fscanf(in,"%d",&v[i]);
    }
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=n;j++)
        {
            for(k=1;k<=n;k++)
            {
                mem.a=i;
                mem.b=j;
                mem.c=k;
                mem.x=1;
                m[v[i]+v[j]+v[k]]=mem;
            }
        }
    }
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=n;j++)
        {
            for(k=1;k<=n;k++)
            {
                if(m[s-v[i]-v[j]-v[k]].x==1)
                {
                    mem=m[s-v[i]-v[j]-v[k]];
                    fprintf(out,"%d %d %d %d %d %d",i,j,k,mem.a,mem.b,mem.c);
                    return 0;
                }
            }
        }
    }
    fprintf(out,"-1");
}