#include<cstdio>
#include<algorithm>

using namespace std;

#define nMax 101

int N, S, Cont;
int v[nMax];

struct Sums {
	int x[nMax*nMax*nMax], y[nMax*nMax*nMax], z[nMax*nMax*nMax];
	int s[nMax*nMax*nMax];
	} p;

void partialSums()
{
	int k=0;
	for(int i=1; i<=N; i++)
		for(int j=1; j<=N; j++)
			for(int l=1; l<=N; l++)
				p.s[++k] = v[i] + v[j] + v[l],
				p.x[k] = i,
				p.y[k] = j,
				p.z[k] = l;
}

void inPut()
{
	freopen ( "loto.in", "r", stdin );
	scanf ( "%d %d", &N, &S );
	
	for(int i=1; i<=N; i++)
		scanf ( "%d", &v[i] );
	fclose(stdin);	
		
	sort ( v+1, v+N+1 );
}

void look(int st, int dr, int x)
{
	if ( st == dr )
	{
		if ( p.s[st] == x )
			Cont = st;
		
		else
			Cont = 0;

		return;
	}

	int cen = (st+dr)/2;

	if ( x <= p.s[cen] )
		look ( st, cen, x );
	
	else
		look ( cen+1, dr, x );
}

int main()
{
	inPut();
	partialSums();

	int Kr=1;
	freopen ( "loto.out", "w", stdout );
	for(; p.s[Kr] <= S && Kr<=N; Kr++);

	for(int i=1; i<=N; i++)
		for(int j=1; j<=N; j++)
			for(int k=1; k<=N; k++)
			{
				look ( 1, Kr, S - v[i] - v[j] - v[k] );
				
				if ( Cont )
				{
					printf ( "%d %d %d %d %d %d\n", v[i], v[j], v[k], p.x[Cont], p.y[Cont], p.z[Cont] );
					fclose(stdin);
					return 0;
				}
			}
	printf ( "-1\n" );
	fclose(stdin);
	
	return 0;
}