using namespace std;

#include <cstdio>
#include <algorithm>
#include <map>

#define IN "loto.in"
#define OUT "loto.out"
#define FOR(i,a,b) for(int i=a;i<=b;++i) 
#define N_MAX 1<<7 


int N,S;
int V[N_MAX],v[N_MAX];

void scan()
{
	freopen(IN, "r",stdin);
	freopen(OUT, "w",stdout);
	scanf("%d%d\n", &N,&S);
	FOR(i,1,N)
		scanf("%d", &v[i]);
}

void solve()
{
	FOR(i,1,N)
	FOR(j,i,N)
	FOR(k,j,N)
	{
		int sum = v[i] + v[j] + v[k];
		V[sum]=i*1000000+j*1000+k;
		if(V[S-sum]) 
		{  
            int x=V[S-sum]%1000;  
			V[S-sum] /= 1000; 
            int y=V[S-sum]%1000;
			V[S-sum] /= 1000; 
            int z=V[S-sum];  
            printf("%d %d %d %d %d %d",v[i],v[j],v[k],v[x],v[y],v[z]);  
            return;  
        }  
	}	
	printf("-1\n");
}

int main()
{
	scan();
	solve();
	return 0;
}