#include<stdio.h>
#include<stdlib.h>

struct nod { int x; };

int cmp( const void *i, const void *j)
{
  nod *ei= (nod*)i, *ej= (nod*)j;
  return ei->x - ej->x;
}

int main()
{
  int n, sum;
  nod v[105];
  freopen("loto.in","r",stdin);
  scanf("%d %d",&n,&sum);
  for(int i=1; i<=n; ++i) scanf("%d",&v[i].x);
  qsort(v, n, sizeof(nod), cmp);

  freopen("loto.out","w",stdout);

  for(int i1=1; i1<=n; ++i1)
    for(int i2=1; i2<=n; ++i2)
      for(int i3=1; i3<=n; ++i3)
        for(int i4=1; i4<=n; ++i4)
          for(int i5=1; i5<=n; ++i5)
            for(int i6=1; i6<=n; ++i6)
              if( v[i1].x+v[i2].x+v[i3].x+v[i4].x+v[i5].x+v[i6].x==sum) {
                printf("%d %d %d %d %d %d\n",v[i1].x,v[i2].x,v[i3].x,v[i4].x,v[i5].x,v[i6].x);
                return 0;
              }
  printf("-1\n");

  return 0;
}