// loto.cpp : Defines the entry point for the console application.
//

#include <stdio.h>
#include <stdlib.h>
int e[104],suma;
int n;

int f[1000001];

int compar(const void * a,const void * b)
{
	 return ( *(int*)a - *(int*)b );

}
void cautb(FILE *f2)
{
	int dr,st,mij,rez,b=0,c=0,l,k,j,d=0;
	for(int i=1;i<=n*n*n;i++)
	{
		st=i;
		dr=n*n*n;
		while(st<=dr)
		{
			mij=st+(dr-st)/2;
			if(f[mij]+f[i]==suma)
			{
				for(j=1;j<=n;j++)
					for(l=1;l<=n;l++)
						for(k=1;k<=n;k++)
						{
							if(!c)
								if(e[j]+e[l]+e[k]==f[mij])
							{
								fprintf(f2,"%d %d %d ",e[j],e[l],e[k]);
								b++;
								c++;
							}
							if(!d)
								if(e[j]+e[l]+e[k]==f[i])
							{
								fprintf(f2,"%d %d %d ",e[j],e[l],e[k]);
								b++;
								d++;
							}
							if(b==2)
								return;
						}

			}
			else if(f[mij]+f[i]>suma)
					dr=mij-1;
			else
				st=mij+1;
		}
		if(b>0)
			break;
	}
	if(b==0)
		fprintf(f2,"-1");
}
int main()
{
	int i,j,l,k,o=1,p;

	FILE *f1,*f2;
	f1=fopen("loto.in","r");
	f2=fopen("loto.out","w");
	fscanf(f1,"%d %d",&n,&suma);
	for(i=1;i<=n;i++)
		fscanf(f1,"%d",&e[i]);
	qsort(e,n,sizeof(int),compar);
	for(i=1;i<=n;i++)
		for(j=1;j<=n;j++)
			for(l=1;l<=n;l++)
			{
				f[o]=e[i]+e[j]+e[l];
				o++;
			}
	qsort(f,n,sizeof(f[0]),compar);	
	cautb(f2);
	fclose(f1);
	fclose(f2);
	return 0;
}