const
  fi = 'loto.in';
  fo = 'loto.out';

var
  f : text;
  i,n : word;
  s : longword;
  a : array [1..100] of longword;
  k1, k2, k3, k4, k5, k6 : word;
  gasit : boolean = false;

begin
  assign(f,fi);
  reset(f);
  read(f,n,s);
  for i := 1 to n do
    read(f,a[i]);
  close(f);

  assign(f,fo);
  rewrite(F);
  for k1 := 1 to n do
    for k2 := k1 to n do
      for k3 := k2 to n do
        for k4 := k3 to n do
          for k5 := k4 to n do
            for k6 := k5 to n do
              if a[k1] + a[k2] + a[k3] + a[k4] + a[k5] + a[k6] = s then
                if not gasit then
                  begin
                    write(f,a[k1],' ',a[k2],' ',a[k3],' ',a[k4],' ',a[k5],' ',a[k6]);
                    gasit := true;
                    close(f);
                    halt;
                  end;
  if not gasit then write(f,-1);
  close(f);
end.