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