#include <fstream>
#include <algorithm>

using namespace std;
ifstream in("loto.in");
ofstream out("loto.out");
int a[6];
int main()
{int n,ok=0,i1,i2,i3,i4,i5,i6,s;
in>>n>>s;
for(i1=0;i1<n;i1++)
    in>>a[i1];
sort(a,a+n);
for(i1=n-1;i1>=0;i1--)
{if(a[i1]>s) i1--;
    for(i2=n-1;i2>=0;i2--)
    {if(a[i1]+a[i2]>s) i2--;
        for(i3=n-1;i3>=0;i3--)
        {if(a[i1]+a[i2]+a[i3]>s) i3--;
            for(i4=n-1;i4>=0;i4--)
            {if(a[i1]+a[i2]+a[i3]+a[i4]>s) i4--;
                for(i5=n-1;i5>=0;i5--)
                {if(a[i1]+a[i2]+a[i3]+a[i4]+a[i5]>s) i5--;
                    for(i6=n-1;i6>=0;i6--)
                    {
                        if(a[i1]+a[i2]+a[i3]+a[i4]+a[i5]+a[i6]==s)
                        {out<<a[i1]<<" "<<a[i2]<<" "<<a[i3]<<" "<<a[i4]<<" "<<a[i5]<<" "<<a[i6]<<'\n';
                        ok=1;
                        i1=i2=i3=i4=i5=i6=-1;
                        }
                    }
                }
            }
        }
    }
}
if(ok==0)out<<-1<<'\n';

in.close();
out.close();

    return 0;
}