var  n:longint;
     s,ss:longint;
     k1,k2,k3,k4,k5,k6:longint;
     i,j,aux:longint;
     a:array[1..100] of longint;
     f,g:text;
     sw:boolean;

 procedure sort(l,r:longint);
 var i,j:longint;
     x,y:longint;
  begin
   i:=l;j:=r;
   x:=a[(l+r) div 2];
   repeat
    while a[i]<x do i:=i+1;
    while x<a[j] do j:=j-1;
    if i<=j then
                begin
                  aux:=a[i];
                  a[i]:=a[j];
                  a[j]:=aux;
                  i:=i+1;
                  j:=j-1;
                end;
   until (i>j);
   if l<j then sort(l,j);
   if i<r  then sort(i,r);
  end;



begin
assign(f,'loto.in');
reset(f);
read(f,n,s);
for i:=1 to n do
read(f,a[i]);
close(f);
sw:=true;
{
for i:=1 to n-1 do
 for j:=i+1 to n do
 if a[i]>a[j] then
              begin
              aux:=a[i];
              a[i]:=a[j];
              a[j]:=aux;
              end;
}
{sort(1,n);}
assign(g,'loto.out');
rewrite(g);
k1:=1;
while (k1<=n) and (sw=true) do
 begin
k2:=k1;
while (k2<=n) and (sw=true) do
  begin
k3:=k2;
while (k3<=n) and (sw=true) do
   begin
k4:=k3;
while (k4<=n) and (sw=true) do
    begin
k5:=k4;
while (k5<=n) and (sw=true) do
     begin
k6:=k5;
while (k6<=n) and (sw=true) do
begin
ss:=a[k1]+a[k2]+a[k3]+a[k4]+a[k5]+a[k6];
if (ss=s) and (sw=true) then begin
             write(g,a[k1],' ',a[k2],' ',a[k3],' ',a[k4],' ',a[k5],' ',a[k6]);
             sw:=false;
             end;
k6:=k6+1;
end;
k5:=k5+1;
end;
k4:=k4+1;
end;
k3:=k3+1;
end;
k2:=k2+1;
end;
k1:=k1+1;
end;

if sw=true then write(g,'-1');
close(g);
end.