# include <stdio.h>

# define nmax 101
# define mmax 1030301
# define FIN "loto.in"
# define FOUT "loto.out"

long n,nr[nmax],s,i,l=0,su[mmax];

long part(long st, long dr)
{
 long i=st, j=dr, s=-1,aux;
 while (i<j)
   {
    if (su[i]>su[j])
      {
       aux=su[i];
       su[i]=su[j];
       su[j]=aux;
       s=-s;
      }
    if (s==1) i++;
         else j--;
   }
 return i;
}

void qsort(long st, long dr)
{
 long p;
 if (st<dr)
   {
    p=part(st,dr);
    qsort(st,p-1);
    qsort(p+1,dr);
   }
}

void afis(long nn)
{
 long a,b,c;
 for (a=1; a<=n; a++)
   for (b=a; b<=n; b++)
     for (c=b; c<=n; c++)
       if (nr[a]+nr[b]+nr[c]==su[nn])
         {
          printf("%ld %ld %ld",nr[a],nr[b],nr[c]);
          return;
          }
}

void solve()
{
 long aux,i,k=l;
 for (long i=1; i<=l&&k>0; i++)
   {
    while (su[i]+su[k]>s && k>0) k--;
    if (k<=0) break; 
    if (su[i]+su[k]==s)
     {
      afis(i);
      printf(" ");
      afis(k);
      return ;
     }
  }
 printf("-1");
}

int main()
{
 freopen(FIN,"r",stdin);
 freopen(FOUT,"w",stdout);
 scanf("%ld %ld",&n,&s);
 
 for (i=1; i<=n; i++)
   scanf("%ld",&nr[i]);
   
 for (i=1; i<=n; i++)
   for (long j=i; j<=n; j++)
     for (long k=j; k<=n; k++)
       {
        su[++l]=nr[i]+nr[j]+nr[k];
       }
       
 qsort(1,l);
 
 solve();
 
 return 0;
}