#include <iostream>
#include <fstream>
#include <algorithm>
#define nmax 101
using namespace std;

ifstream f("loto.in");
ofstream g("loto.out");

int v[nmax];
int n,s;

void read()   /// OK
{
    f>>n>>s;
    for(int i=1;i<=n;++i)f>>v[i];
}
bool solve()
{
    for(int i1=1;i1<=n;i1++)
        for(int i2=1;i2<=n;i2++)
            for(int i3=1;i3<=n;i3++)
                for(int i4=n;i4>=1;i4--)
                    for(int i5=n;i5>=1;i5--)
                        for(int i6=n;i6>=1;i6--)
                        {
                            if(v[i1]+v[i2]+v[i3]+v[i4]+v[i5]+v[i6] == s)
                            {
                                g<<i1<<" "<<i2<<" "<<i3<<" "
                                    <<i4<<" "<<i5<<" "<<i6<<" ";
                                return true;
                            }
                        }
                return false;
}
int main()
{
    read();
    if(!solve())g<<-1;
    return 0;
}