#include <stdio.h>
#include <algorithm>

using namespace std;
FILE *f=fopen("loto.in","r");
FILE *g=fopen("loto.out","w");

int n,s,i,v[105],nr,ss,a[105],p,sm;

int caut (int v[],int c)
{
 int p,u,k,m;
  p=1;
  u=n;
  k=0;
  while(p<=u)
  {
    m=(u+p)/2;
   if (v[m]<=c)
   {
     if (v[m]>k)k=v[m];
    p++;
   }
   else u=m-1;
  }
return k;

}

int main()
{
fscanf(f,"%d%d",&n,&s);
for(i=1;i<=n;i++)
fscanf(f,"%d",&v[i]);
  sort(v+1,v+n+1);
sm=s;
nr=s;
ss=0;
for(i=6;i>=1;i--)
{
  p=sm/i;
   nr=caut(v,p);
  a[6-i+1]=nr;
  ss+=nr;
  sm-=nr;
}


if (ss==s)
  {for(i=1;i<=6;i++)
   fprintf(g,"%d ",a[i]);
  }
else fprintf(g,"%d",-1);
fclose(g);
return 0;
}