#include <iostream>
#include <set>
#include <fstream>
using namespace std;
ifstream in ("loto.in");
ofstream out ("loto.out");
int N, S, v[101];
int main()
{
    in>>N>>S;
    set <int> x;
    int v[100];
    for (int i=0;i<N;++i)
    {
        in>>v[i];
    }

    for (int i=0;i<N;++i)
        for (int j=i;j<N;++j)
            for (int k=j;k<N;++k)
            {
                int suma=v[i]+v[j]+v[k];
                x.insert(suma);
            }
    for (int i=0;i<N;i++)
        for (int j=i;j<N;++j)
            for (int k=j;k<N;++k)
            {
                int opus=S-(v[i]+v[k]+v[j]);
                if (x.find(opus)!=x.end())
                {
                    for (int l=0;l<N;++l)
                        for (int m=l;m<N;++m)
                            for (int p=m;p<N;p++)
                            {
                                int suma=v[l]+v[m]+v[p];
                                if (suma==opus)
                                {
                                    out<<v[i]<<" "<<v[j]<<" "<<v[k]<<" "<<v[l]<<" "<<v[m]<<" "<<v[p];
                                    return 0;
                                }

                            }
                    }
            }
    out<<-1;
    return 0;
}