#include<stdio.h>
#include<algorithm>
using namespace std;
int  a[100],s;
int sor[1000001],i,j,k,n,nr;

struct nod
{ int x,y,z,s;
} b[1000001];

bool fcomp(int x,int y)
{ return b[x].s<b[y].s;
} 

int main()
{ freopen("loto.in","r",stdin);
  freopen("loto.out","w",stdout);
  scanf("%d %d",&n,&s);
  for(i=1;i<=n;i++) scanf("%d",&a[i]);
  
  for(i=1;i<=n;i++)
      for(j=i;j<=n;j++)
          for(k=j;k<=n;k++)
                 { b[++nr].x=a[i];
                   b[nr].y=a[j];
                   b[nr].z=a[k];
                   b[nr].s=a[i]+a[j]+a[k];
                   sor[nr]=nr;
                 }
  sort(sor+1,sor+nr+1,fcomp);
  k=nr;
  for(i=1;i<=nr&&k>0;++i) 
   { 
     while(b[sor[i]].s+b[sor[k]].s>s&&k>0) --k;
     if(k<=0) break;
     if(b[sor[i]].s+b[sor[k]].s==s) { printf("%d ",b[sor[i]].x);
                                      printf("%d ",b[sor[i]].y);
                                      printf("%d ",b[sor[i]].z);
                                      printf("%d ",b[sor[k]].x);
                                      printf("%d ",b[sor[k]].y);
                                      printf("%d \n",b[sor[k]].z);
                                        fclose(stdin);
                                        fclose(stdout);
                                        return 0;
                                      } 
    }
  printf("-1\n");
  fclose(stdin);
  fclose(stdout);
  return 0;
}