#include <stdio.h>
#include <algorithm>
using namespace std;

int A[101],n,B[7],ok=0,S1,S[7];

void back(int p)
{
int i;
for (i=1;i<=n && !ok;i++)
{
B[p]=i;
S[p]=S[p-1]+A[B[p]];
if (S[p]<=S1) if (S[p]==S1) if (p==6) ok=1;
                            else;
              else if (p<6) back(p+1);
}
}

int main()
{
freopen("loto.in","r",stdin);
freopen("loto.out","w",stdout);

int i;
scanf("%d%d",&n,&S1);
for (i=1;i<=n;i++) scanf("%d",&A[i]);
sort(A+1,A+n+1);
back(1);
if (ok) printf("%d %d %d %d %d %d",A[B[1]],A[B[2]],A[B[3]],A[B[4]],A[B[5]],A[B[6]]);
else printf("-1");
}