#include <fstream>
#include <algorithm>
using namespace std;
int a[101],i1,i2,i3,i4,i5,i6,s,n,i;
int main()
{
    ifstream f("loto.in");
    ofstream g("loto.out");
    f>>n>>s;
    for (i=1;i<=n;i++) f>>a[i];
    sort(a+1,a+n+1);
    for (i1=n;i1>=1;i1--)
    for (i2=n;i2>=1;i2--)
    for (i3=n;i3>=1;i3--)
    for (i4=n;i4>=1;i4--)
    for (i5=n;i5>=1;i5--)
    for (i6=n;i6>=1;i6--)
    if (a[i1]+a[i2]+a[i3]+a[i4]+a[i5]+a[i6]==s) {g<<a[i1]<<" "<<a[i2]<<" "<<a[i3]<<" "<<a[i4]<<" "<<a[i5]<<" "<<a[i6]<<'\n';i1=0;i2=0;i3=0;i4=0;i5=0;i6=0;}
    if (i1==1&&i2==1&&i3==1&&i4==1&&i5==1&&i6==1&&a[i1]+a[i2]+a[i3]+a[i4]+a[i5]+a[i6]!=s) g<<"-1"<<'\n';
    f.close();
    g.close();
    return 0;
}